Implementation issues in solving nonlinear equations for two-point boundary value problems (Q2641087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implementation issues in solving nonlinear equations for two-point boundary value problems |
scientific article; zbMATH DE number 4189112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementation issues in solving nonlinear equations for two-point boundary value problems |
scientific article; zbMATH DE number 4189112 |
Statements
Implementation issues in solving nonlinear equations for two-point boundary value problems (English)
0 references
1990
0 references
Complex numerical methods often contain subproblems that are easy to state in mathematical form, but difficult to translate into software. Several algorithmic issues of this nature arise in implementing a Newton iteration scheme as part of a finite-difference method for two-point boundary value problems. We describe the practical as well as theoretical considerations behind the decisions included in the final code, with special emphasis on two ``watchdog'' strategies designed to improve reliability and allow early termination of the Newton iterates.
0 references
nonlinear algebraic equations
0 references
merit functions
0 references
mathematical software
0 references
watchdog strategy
0 references
Newton iteration scheme
0 references
finite-difference method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7904337644577026
0 references
0.7806674838066101
0 references
0.7790291905403137
0 references
