1D-grid generation by monotone iteration discretization (Q908665)
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 4135331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 1D-grid generation by monotone iteration discretization |
scientific article; zbMATH DE number 4135331 |
Statements
1D-grid generation by monotone iteration discretization (English)
0 references
1990
0 references
The numerical solution of weakly nonlinear two-point boundary value problems based on monotone discretization is considered. A new feedback grid generation principle is proposed. By means of available estimations resulting from lower and upper solutions the grid is refined automatically. The monotonicity of the method is guaranteed by principles of monotone iterations. The convergence properties of the proposed algorithm are analyzed.
0 references
weakly nonlinear
0 references
monotone discretization
0 references
feedback grid generation
0 references
lower and upper solutions
0 references
monotone iterations
0 references
convergence
0 references
algorithm
0 references
0 references
0 references
0 references
0.8564344644546509
0 references
0.8125434517860413
0 references
0.7686285376548767
0 references
