On generalized Newton algorithms: quadratic convergence, path-following and error analysis

Theoretical Computer Science

Volumn 133, Issue 1, 1994, Pages 65-84

  Malajovich, Gregorio ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; POLYNOMIALS; THEOREM PROVING;

INTEGERS; NEWTON ALGORITHMS; NEWTON ITERATION; QUADRATIC CONVERGENCE THEOREM; ROBUSTNESS THEOREM;

ALGORITHMS;

EID: 0028516907     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00065-4     Document Type: Article

References (10)

1. Continuation and path-following
2. On a theory of computation and complexity over the real numbers NP-completeness recursive functions and universal machines
3. On the complexity of path-following Newton algorithms for solving systems of polynomial equations with integer coefficients
4. Some remarks on Bezout's Theorem and complexity theory
5. On the Complexity of Bezout's Theorem I - Geometric aspects
6. On the complexity of Bezout's Theorem II - Volumes and Probabilities
7. Complexity of Bezout's Theorem III; Condition number and packing
8. Newton method estimates from data at one point