Asymptotic near optimality of the bisection method (Q913453): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5657612 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bisection is optimal / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Study of linear information for classes of polynomial equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5732060 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds and Fast Algorithms for Sequence Acceleration / rank | |||
Normal rank | |||
Latest revision as of 15:44, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic near optimality of the bisection method |
scientific article |
Statements
Asymptotic near optimality of the bisection method (English)
0 references
1990
0 references
The authors prove that, roughly speaking, the bisection method has asymptotically the best rate of convergence only for the class of functions with zeros of infinite multiplicity.
0 references
asymptotic near optimality
0 references
bisection method
0 references
best rate of convergence
0 references
zeros of infinite multiplicity
0 references
