Computational Complexity of Iterative Processes

DOI10.1137/0201012zbMath0226.68025OpenAlexW2073218959MaRDI QIDQ5633653

J. F. Traub

Publication date: 1972

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1012.8587

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Second-derivative free methods of third and fourth order for solving nonlinear equations, A survey of techniques in applied computational complexity, Comparing parallel Newton's method with parallel Laguerre's method, Square rooting is as difficult as multiplication, A bound on the multiplicative efficiency of iteration