On a class of omnibus algorithms for zero-finding (Q1118978)
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: On a class of omnibus algorithms for zero-finding |
scientific article; zbMATH DE number 4096689
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a class of omnibus algorithms for zero-finding |
scientific article; zbMATH DE number 4096689 |
Statements
On a class of omnibus algorithms for zero-finding (English)
0 references
1989
0 references
A modification of the algorithm presented by \textit{J. C. P. Bus} and \textit{T. J. Dekker} [ACM Trans. Math. Software 1, 330-345 (1975; Zbl 0315.65031)] for finding a zero of a single nonlinear function is presented. It is shown that this modification is asymptotically better than R- and M-algorithms and bisections. Numerical examples are given.
0 references
omnibus algorithms
0 references
zero-finding
0 references
iterative algorithm
0 references
root
0 references
Numerical examples
0 references
0 references
0 references
0 references
