Numerov's method for non-linear two-point boundary value problems II. monotone approximations (Q4734708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4121349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerov's method for non-linear two-point boundary value problems II. monotone approximations |
scientific article; zbMATH DE number 4121349 |
Statements
Numerov's method for non-linear two-point boundary value problems II. monotone approximations (English)
0 references
1989
0 references
monotone approximations
0 references
finite difference equations
0 references
Numerov's method
0 references
Newton's method
0 references
numerical examples
0 references
0.9220930933952332
0 references
0.8610902428627014
0 references
0.8412097692489624
0 references
In part I [ibid. 17, 167-176 (1985; Zbl 0566.65064)] the first and the third author considered in detail the application of Newton's method for solving a nonlinear system of finite difference equations which arises using Numerov's method for the problem: \(y''+f(x,y)=0,\quad 0\leq x\leq 1,\quad y(0)=a,\quad y(1)=b.\) In this paper the authors present an iteration scheme which provides a monotonically decreasing or increasing sequence of approximations that converges to the solution of the Numerov discretization equations. This scheme does not require the setting up of the Jacobian matrix of the nonlinear system of equations, and involves less function evaluations (N- 1 in each iteration vs. 2(N-1) in each iteration of Newton's method). Two numerical examples given indicate that the proposed method is better or at least comparable with Newton's method.
0 references