High-Order Numerical Method for Two-Point Boundary Value Problems
β Scribed by Dianyun Peng
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 224 KB
- Volume
- 120
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper the two-point boundary value problem is transformed into general first-order ordinary differential equation system through introduction of conditions of an integral character to supplement the simultaneous set of first-order equations. A new discrete approximation of a high-order compact difference scheme is presented for the first-order system. It is a block-bidiagonal profile and removes the limits of other high-order discrete schemes at the interval ends. The numerical tests of a seventh-order compact difference scheme show that the proposed scheme is very convenient and efficient for linear and nonlinear two-point boundary value problems. 1995 Academic Press, Inc.
π SIMILAR VOLUMES
Suppose that h g L 0, , g g C R, R , and lim g t rt s 0. With the Saddle Point Theorem, the solvability is proved for the two-point boundary value problem under the condition that F y Ο±sin x dxh x sin x dx -F qΟ± sin x dx,
We present new finite difference methods of order at most O(hh) for computing eigenvalues of two-point boundary value problems. Our methods lead to generalized seven-band matrix eigenvalue problems. Some typical boundary value problems are treated numerically and these numerical results are summariz
Cubic basis functions in one dimension for the solution of two-point boundary value problems are constructed based on the zeros of Chebyshev polynomials of the first kind. A general formula is derived for the construction of polynomial basis functions of degree r, where 1 Qr< co. A Galerkin finite e