On generalized Newton algorithms: quadratic convergence, path-following and error analysis
- 10 October 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 133 (1) , 65-84
- https://doi.org/10.1016/0304-3975(94)00065-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- COMPLEXITY OF BEZOUT'S THEOREM IV: PROBABILITY OF SUCCESS; EXTENSIONSPublished by World Scientific Pub Co Pte Ltd ,2000
- Complexity of Bezout′s TheoremJournal of Complexity, 1993
- Some Remarks on Bezout’s Theorem and Complexity TheoryPublished by Springer Nature ,1993
- Continuation and path followingActa Numerica, 1993
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989