Study of linear information for classes of polynomial equations

DOI10.1007/BF01837941zbMath0677.65049MaRDI QIDQ1123546

S. H. Smith

Publication date: 1989

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137292

zbMATH Keywords

optimal informationbisection methodlinear sequential informationreal zeros of real polynomials

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

Optimal solution of nonlinear equations, Average errors for zero finding: Lower bounds for smooth or monotone functions, Asymptotic near optimality of the bisection method

Cites Work

• Unnamed Item
• For which error criteria can we solve nonlinear equations?
• Bisection is optimal
• Any iteration for polynomial equations using linear information has infinite complexity
• On the cost of computing roots of polynomials
• On the cost of approximating all roots of a complex polynomial
• On the Optimal Solution of Large Linear Systems
• The fundamental theorem of algebra and complexity theory
• Global Convergence of a Modified Newton Iteration for Algebraic Equations