Computational Complexity of Iterative Processes

DOI10.1137/0201012zbMATH Open0226.68025OpenAlexW2073218959MaRDI QIDQ5633653FDOQ5633653

Authors: 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)

Cited In (5)

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

This page was built for publication: Computational Complexity of Iterative Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633653)