Discretization of implicit ODEs for singular root-finding problems (Q1602808)
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: Discretization of implicit ODEs for singular root-finding problems |
scientific article; zbMATH DE number 1758454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discretization of implicit ODEs for singular root-finding problems |
scientific article; zbMATH DE number 1758454 |
Statements
Discretization of implicit ODEs for singular root-finding problems (English)
0 references
24 June 2002
0 references
The iteration generated by the numerical integration of an ordinary differential equation (ODE) may be studied as a discrete dynamical system. Starting from this fact, the paper considers different discretizations of continuous-time models for singular root-finding and optimization problems. The paper is devoted, firstly, to the use of discrete-time analysis techniques for singular problems, based on continuous-time stability and numerical stability and, secondly, to introduce a systematic methodology for the formulation of quadratically convergent iterations for singular root-finding problems.
0 references
continuous-time model
0 references
quadratic convergence
0 references
iterative method
0 references
discrete dynamical system
0 references
explicit Runge-Kutta methods
0 references
continuous Newton method
0 references
singular root-finding
0 references
optimization
0 references
discrete-time analysis
0 references
continuous-time stability
0 references
numerical stability
0 references
0 references
0 references
0 references
0 references
0 references
0.7475370764732361
0 references
0.7242862582206726
0 references
