Tight bounds on the complexity index of one-point iterations
From MaRDI portal
Publication:1145499
DOI10.1016/0898-1221(80)90050-4zbMath0445.68027OpenAlexW2032937800MaRDI QIDQ1145499
Publication date: 1980
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(80)90050-4
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10)
Related Items
Cites Work
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- Convergence and complexity of interpolatory-Newton iteration in a Banach space
- On the evaluation of multivariate polynomials and their derivatives
- Fast Algorithms for Manipulating Formal Power Series
- HOW TO DECREASE THE COMBINATORY COMPLEXITY
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tight bounds on the complexity index of one-point iterations