Solution of multiple point, nonlinear boundary value problems by method of weighted residuals. (English) Zbl 0653.65059
Summary: A new numerical method for solving non-linear boundary value problems with the boundary value specified at multiple points is presented. The present paper is an extension of an earlier work where boundary conditions were specified only at the end. The method proceeds with first linearizing the problem by an initial guess for the nonlinear terms. Next the method of weighted residuals is applied to compute all boundary quantities for the approximate solution corresponding to the linearized version. This converts the boundary value problem to an initial value problem which is solved by a Runge-Kutta scheme. The resulting solution is used as an improved guess for the next iteration. The process is repeated until convergence to a prescribed tolerance is achieved. Illustrative applications from bending of sandwich beams and outflow of an incompressible fluid from a narrow two dimensional slit are included.
MSC:
65L10 | Numerical solution of boundary value problems involving ordinary differential equations |
34B10 | Nonlocal and multipoint boundary value problems for ordinary differential equations |
34B15 | Nonlinear boundary value problems for ordinary differential equations |
Keywords:
multiple point boundary value problem; method of weighted residuals; Runge-Kutta scheme; iteration; convergence; sandwich beamsReferences:
[1] | DOI: 10.1016/0307-904X(83)90135-X · Zbl 0515.65061 · doi:10.1016/0307-904X(83)90135-X |
[2] | Na T. Y., Computational Methods in Engineering Boundary Value Problems (1979) · Zbl 0456.76002 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.