Newton's method for analytic systems of equations with constant rank derivatives (Q1599200): Difference between revisions

The authors investigate the convergence properties of Newton's sequence for systems of analytic equations with constant rank derivatives. Their main result is an alpha-theorem which ensures the convergence of Newton's sequence to a least-square solution of this system.

0 references

reviewed by

Karel Najzar

0 references

zbMATH Keywords

Newton's method

0 references

system of nonlinear equations

0 references

Banach spaces

0 references

least-square solution

0 references

constant rank derivatives

0 references

convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3139554

0 references

A Newton-Raphson method for the solution of systems of equations

0 references

Q4372496

0 references

Newton's method for overdetermined systems of equations

0 references

Q3702408

0 references

Q3996907

0 references

Complexity of Bezout's Theorem I: Geometric Aspects

0 references

Complexity of Bezout’s Theorem IV: Probability of Success; Extensions

0 references

On the efficiency of algorithms of analysis

0 references

Q3816922

0 references

Q4720691

0 references

Q3998482

0 references

Identifiers

zbMATH Open document ID

1003.65056

0 references

DOI

10.1006/jcom.2001.0612

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1599200

@@ Property / OpenAlex ID @@
+W1993642316
@@ Property / OpenAlex ID: W1993642316 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139554
@@ Property / cites work: Q3139554 / rank @@
+Normal rank
@@ Property / cites work @@
+A Newton-Raphson method for the solution of systems of equations
+Normal rank
@@ Property / cites work @@
+Q4372496
@@ Property / cites work: Q4372496 / rank @@
+Normal rank
@@ Property / cites work @@
+Newton's method for overdetermined  systems of equations
+Normal rank
@@ Property / cites work @@
+Q3702408
@@ Property / cites work: Q3702408 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996907
@@ Property / cites work: Q3996907 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's Theorem I: Geometric Aspects
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+On the efficiency of algorithms of analysis
@@ Property / cites work: On the efficiency of algorithms of analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q3816922
@@ Property / cites work: Q3816922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4720691
@@ Property / cites work: Q4720691 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998482
@@ Property / cites work: Q3998482 / rank @@
+Normal rank