Study of linear information for classes of polynomial equations
- 1 February 1989
- journal article
- Published by Springer Nature in Aequationes mathematicae
- Vol. 37 (1) , 1-14
- https://doi.org/10.1007/bf01837941
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- For which error criteria can we solve nonlinear equations?Journal of Complexity, 1986
- On the cost of approximating all roots of a complex polynomialMathematical Programming, 1985
- On the cost of computing roots of polynomialsMathematical Programming, 1984
- Any iteration for polynomial equations using linear information has infinite complexityTheoretical Computer Science, 1983
- On the average cost of solving polynomial equationsPublished by Springer Nature ,1983
- Global Convergence of a Modified Newton Iteration for Algebraic EquationsSIAM Journal on Numerical Analysis, 1982
- Bisection is optimalNumerische Mathematik, 1982
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981