Newton's method with deflation for isolated singularities of polynomial systems

Theoretical Computer Science

Volumn 359, Issue 1-3, 2006, Pages 111-122

  Leykin, Anton ^a   Verschelde, Jan ^a   Zhao, Ailing ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Deflation; Newton's method; Numerical homotopy algorithms; Reconditioning; Symbolic numeric computations

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATION THEORY; COMPUTER SCIENCE; QUADRATIC PROGRAMMING;

DEFLATION; NEWTON'S METHOD; NUMERICAL HOMOTOPY ALGORITHMS; RECONDITIONING; SYMBOLIC-NUMERIC COMPUTATIONS;

POLYNOMIALS;

EID: 33746348355     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.02.018     Document Type: Article

References (58)

1. Allgower E.L., and Georg K. Introduction to Numerical Continuation Methods, Classics in Applied Mathematics Vol. 45 (2003), SIAM, Philadelphia, PA
2. Björck G., and Fröberg R. A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots. J. Symbolic Comput. 12 3 (1991) 329-336
3. G. Björck, R. Fröberg, Methods to "divide out" certain solutions from systems of algebraic equations, applied to find all cyclic 8-roots, in: M. Gyllenberg, L.E. Persson (Eds.), Analysis, Algebra and Computers in Mathematical Research, Lecture Notes in Mathematics, Vol. 564, Dekker, New York, NY, 1994, pp. 57-70.
4. Blum L., Cucker F., Shub M., and Smale S. Complexity and Real Computation (1998), Springer, Berlin
5. Cox D., Little J., and O'Shea D. Using Algebraic Geometry, Graduate Texts in Mathematics Vol. 185 (1998), Springer, Berlin
6. Dayton B.H., and Zeng Z. Computing the multiplicity structure in solving polynomial systems. In: Kauers M. (Ed). Proc. 2005 Internat. Symp. Symbolic and Algebraic Computation (2005), ACM, New York 116-123
7. Decker D.W., Keller H.B., and Kelley C.T. Convergence rates for Newton's method at singular points. SIAM J. Numer. Anal. 20 2 (1983) 296-314
8. Decker D.W., Keller H.B., and Kelley C.T. Broyden's method for a class of problems having singular Jacobian at the root. SIAM J. Numer. Anal. 22 (1985) 566-574
9. Decker D.W., and Kelley C.T. Newton's method at singular points: II. SIAM J. Numer. Anal. 17 3 (1980) 465-471
10. Dedieu J.P., and Shub M. Newton's method for overdetermined systems of equations. Math. Comp. 69 231 (1999) 1099-1115
11. Deuflhard P. Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms (2004), Springer, Berlin
12. Deuflhard P., Friedler B., and Kunkel P. Efficient numerical path following beyond critical points. SIAM J. Numer. Anal. 24 (1987) 912-927
13. C. Durand, Symbolic and numerical techniques for constraint solving, Ph.D. Thesis, Purdue University, Department of Computer Science, 1998.
14. 4), J. Pure Appl. Algebra 139(1-3):61-88, 1999, Proc. MEGA'98, 22-27 June 1998, Saint-Malo, France.
15. Fierro R.D., and Hansen P.C. Utv expansion pack: special-purpose rank-revealing algorithms. Numer. Algorithms 40 1 (2005) 47-66
16. Gao T., and Li T.Y. Mixed volume computation for semi-mixed systems. Discrete Comput. Geom. 29 2 (2003) 257-277
17. M. Giusti, G. Lecerf, B. Salvy, J.C. Yakoubsohn, On location and approximation of clusters of zeroes: case of embedding dimension one, Manuscript, 2004.
18. Giusti M., Lecerf G., Salvy B., and Yakoubsohn J.C. On location and approximation of clusters of zeroes of analytic functions. Found. Comput. Math. 5 3 (2005) 257-311
19. W.J.F. Govaerts, Numerical Methods for Bifurcations of Dynamical Equilibria, SIAM, Philadelphia, PA, 2000.
20. Greuel G.-M., and Pfister G. Advances and improvements in the theory of standard bases and syzygies. Arch. Math. 66 (1996) 163-196
21. Greuel G.-M., and Pfister G. A Singular Introduction to Commutative Algebra (2002), Springer, Berlin
22. G.-M. Greuel, G. Pfister, H. Schönemann, SINGULAR 2.0, A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern, 2001 〈http://www.singular.uni-kl.de〉.
23. Griewank A. On solving nonlinear equations with simple singularities or nearly singular solutions. SIAM Rev. 27 4 (1985) 537-563
24. Griewank A. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation (2000), SIAM, Philadelphia, PA
25. Gunji T., Kim S., Kojima M., Takeda A., Fujisawa K., and Mizutani T. PHoM-a polyhedral homotopy continuation method for polynomial systems. Computing 73 1 (2004) 57-77
26. Haagerup U. Orthogonal maximal abelian *-algebras of the n × n matrices and cyclic n-roots. Operator Algebras and Quantum Field Theory (1996), International Press 296-322
27. Kearfott R.B., and Dian J. Existence verification for higher degree singular zeros of nonlinear systems. SIAM J. Number. Anal. 41 6 (2003) 2350-2373
28. Kobayashi H., Suzuki H., and Sakai Y. Numerical calculation of the multiplicity of a solution to algebraic equations. Math. Comp. 67 221 (1998) 257-270
29. Kunkel P. Efficient computation of singular points. IMA J. Numer. Anal. 9 (1989) 421-433
30. Kunkel P. A tree-based analysis of a family of augmented systems for the computation of singular points. IMA J. Numer. Anal. 16 (1996) 501-527
31. Lecerf G. Quadratic Newton iteration for systems with multiplicity. Found. Comput. Math. 2 (2002) 247-293
32. A. Leykin, J. Verschelde, A. Zhao, Evaluation of Jacobian matrices for Newton's method with deflation to approximate isolated singular solutions of polynomial systems, in: D. Wang, L. Zhi (Eds.), SNC 2005 Proc. Internat. Workshop on Symbolic-Numeric Computation, Xi'an, China, July 19-21, 2005, 2005, pp. 19-28.
33. Li T.Y. Numerical solution of multivariate polynomial systems by homotopy continuation methods. Acta Numer. 6 (1997) 399-436
34. T.Y. Li, Numerical solution of polynomial systems by homotopy continuation methods, in: F. Cucker (Ed.), Handbook of Numerical Analysis, Volume XI. Special Volume: Foundations of Computational Mathematics, North-Holland, Amsterdam, 2003, pp. 209-304.
35. Li T.Y., and Li X. Finding mixed cells in the mixed volume computation. Found. Comput. Math. 1 2 (2001) 161-181
36. Li T.Y., and Wang X. Solving real polynomial systems with real homotopies. Math. Comp. 60 (1993) 669-680
37. Li T.Y., and Wang X. Higher order turning points. Appl. Math. Comput. 64 (1994) 155-166
38. Li T.Y., and Zeng Z. A rank-revealing method with updating, downdating and applications. SIAM J. Matrix Anal. Appl. 26 4 (2005) 918-946
39. F.S. Macaulay, The Algebraic Theory of Modular Systems, Cambridge University Press, Cambridge, 1916, Reissued with an Introduction by Paul Roberts in the Cambridge Mathematical Library, 1994.
40. Marinari M.G., Moeller H.M., and Mora T. On multiplicities in polynomial system solving. Trans. Amer. Math. Soc. 348 8 (1996) 3283-3321
41. F. Mora, An algorithm to compute the equations of tangent cones, in: J. Calmet (Ed.), Computer Algebra, EUROCAM'82, European Computer Algebra Conference, Marseille, France, April 1982, Lecture Notes in Computer Science, Vol. 144, Springer, Berlin, 1982, pp. 158-165.
42. Mora T. Gröbner duality and multiple points in linearly general position. Proc. Amer. Math. Soc. 125 5 (1997) 1273-1282
43. Moritsugu S., and Kuriyama K. On multiple zeros of systems of algebraic equations. In: Dooley S. (Ed). Proc. 1999 Internat. Symp. Symbolic and Algebraic Computation (ISSAC 1999) (1999), ACM, New York 23-30
44. Mourrain B. Isolated points, duality and residues. J. Pure Appl. Algebra 117/118 (1997) 469-493
45. Ojika T. Modified deflation algorithm for the solution of singular problems, I. A system of nonlinear algebraic equations. J. Math. Anal. Appl. 123 (1987) 199-221
46. Ojika T. Modified deflation algorithm for the solution of singular problems, II. Nonlinear multipoint boundary value problems. J. Math. Anal. Appl. 123 (1987) 222-237
47. Ojika T. A numerical method for branch points of a system of nonlinear algebraic equations. Appl. Numer. Math. 4 (1988) 419-430
48. Ojika T., Watanabe S., and Mitsui T. Deflation algorithm for the multiple roots of a system of nonlinear equations. J. Math. Anal. Appl. 96 (1983) 463-479
49. Ortega J.M., and Rheinboldt W.C. Iterative Solution of Nonlinear Equations in Several Variables, Classics in Applied Mathematics Vol. 30 (2000), SIAM, Philadelphia, PA
50. L.B. Rall, Automatic Differentiation: Techniques and Applications, Lecture Notes in Computer Science, Vol. 120, Springer, Berlin, 1981.
51. A.J. Sommese, C.W. Wampler, Numerical algebraic geometry, in: J. Renegar, M. Shub, S. Smale (Eds.), The Mathematics of Numerical Analysis, Lectures in Applied Mathematics, Vol. 32, American Mathematical Society, Providence, RI, 1996, pp. 749-763. Proc. AMS-SIAM Summer Seminar in Applied Mathematics, Park City, Utah, July 17-August 11, 1995, Park City, Utah.
52. Sommese A.J., and Wampler C.W. The Numerical Solution of Systems of Polynomials Arising in Engineering and Science (2005), World Scientific, Singapore
53. n. Trans. Amer. Math. Soc. 354 (2002) 4815-4829 〈http://www.math.tamu.edu/∼sottile/pages/spheres/index.html〉 offers a nice computer algebra supplement.
54. Stetter H.J. Numerical Polynomial Algebra (2004), SIAM, Philadelphia, PA
55. Sturmfels B. Solving Systems of Polynomial Equations. CBMS Regional Conference Series in Mathematics Vol. 97 (2002), American Mathematical Society, Providence, RI
56. J. Verschelde, Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Softw. 25(2) (1999) 251-276. Software available at 〈http://www.math.uic.edu/∼jan〉.
57. J. Verschelde, A. Zhao, Newton's method with deflation for isolated singularities, Poster presented at ISSAC'04, 6 July 2004, Santander, Spain. Available at 〈http://www.math.uic.edu/∼jan/poster.pdf〉 and at 〈http://www.math.uic.edu/∼azhao1/poster.pdf〉.
58. Ypma T.Y. Historical development of the Newton-Rapson method. SIAM Rev. 37 4 (1995) 531-551