In this paper four algorithms of methods of approximate solution of the two-point boundary value problem for the equation - u” + g(x)u = f(x) are given and compared. The finite difference, collocation, finite element and collocation-Galerkin methods are considered. Numerical results are presented. For sufficiently regular functions u,f and g the finite difference method is the most effective.
Approximate methods for solving two-point boundary value problems are considered. The aim of the paper is to explain superconvergence effect in the methods using finite element spaces. The existence of a class of the methods with the superconvergence property is demonstrated. Detailed proofs of superconvergence are presented for the case of the Galerkin method (due to Douglas and Dupont results) and for some example of external method.
In the paper, the H^(-1)Galerkin-collocation method with quadratures (instead of integrals) for two point boundary value problems is considered. Approximate solution is a piecewise polynomial of degree r. It is proved that the method is stable and the error in L2-norm is of order O(h^(r+1)) if the used quadrature is exact for polynomial of degree not greater than r+1.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.