Finding zeros by multilevel subdivision techniques (Q4548052)
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 1786762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding zeros by multilevel subdivision techniques |
scientific article; zbMATH DE number 1786762 |
Statements
Finding zeros by multilevel subdivision techniques (English)
0 references
4 February 2003
0 references
multilevel subdivision technique
0 references
global zero finding
0 references
invariant sets of dynamical systems
0 references
convergence
0 references
algorithm
0 references
a priori step size strategy
0 references
adaptive Armijo step size strategy
0 references
0.790471076965332
0 references
0.7858694791793823
0 references
0.7667369246482849
0 references
0.7579045295715332
0 references
0.7525134682655334
0 references
The subject is the detection of all zeros of a given smooth function within a compact region. The authors propose a new approach: an adaptive multilevel scheme for the outer approximation of the set of zeros inside a specified compact set. The main idea is to view interaction schemes as dynamical systems and then to apply adaptive set-oriented numerical methods which have been developed for the approximation of invariant sets of dynamical systems. The convergence of the algorithm is proved. The effect of choosing different step sizes on the behaviour of the algorithm is also studied by a couple of examples. Two strategies are discussed: a priori step size strategy and adaptive Armijo step size strategy. The numerical efficiency of the different approaches are compared. Another comparison is done relative to a standard finding procedure from NAG library.
0 references
