Newton's method on Riemannian manifolds: Covariant alpha theory

IMA Journal of Numerical Analysis

Volumn 23, Issue 3, 2003, Pages 395-419

  Dedieu, Jean Pierre ^a   Priouret, Pierre ^a   Malajovich, Gregorio ^b  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Alpha theory; Newton iteration; Non linear equations

Indexed keywords

NEWTON-RAPHSON METHOD; VECTOR SPACES;

ALPHA THEORY; COVARIANT DERIVATIVES; LINEAR SPACES; NEWTON ITERATIONS; NEWTON'S METHODS; QUADRATIC CONVERGENCE; RIEMANNIAN MANIFOLD; SECTIONAL CURVATURES;

GEOMETRY;

EID: 0242323292     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/23.3.395     Document Type: Article

References (38)

1. ADLER, R., DEDIEU, J.-P, MARGULIES, J., MARTENS, M. & SHUB, M. (2002) Newton method on Riemannian manifolds and a geometric model for the human spine. IMA J. Numer. Anal., 22, 1-32.
2. BLUM, L., CUCKER, F., SHUB, M. & SMALE, S. (1998) Complexity and Real Computation. Berlin: Springer.
3. CELLEDONI, E. & ISERLES, A. (2001) Methods for the approximation of the matrix exponential in a Lie-algebraic setting. IMA J. Numer. Anal, 21, 463-488.
4. DEDIEU, J.-P. & KIM, M.-H. (2002) Newton's method for analytic systems of equations with constant rank derivatives. J. Complexity, 18, 187-209.
5. DEDIEU, J.-P. & SHUB, M. (2000a) Newton's method for overdetermined systems of equations. Math. Comput., 69, 1099-1115.
6. DEDIEU, J.-P. & SHUB, M. (2000b) Multihomogeneous Newton's method. Math. Comput., 69, 1071-1098.
7. DIEUDONNÉ, J. (1988) Treatise on Analysis. New York: Academic.
8. DO CARMO, M. (1992) Riemannian Geometry. Boston: Birkhäuser.
9. EDELMAN, A., ARIAS, T. & SMITH, S. (1998) The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl., 20, 303-353.
10. FERREIRA, O. & SVAITER, B. Kantorovich's theorem on Newton's method in Riemannian manifolds. J. Complexity, to appear.
11. GALLOT, S., HULIN, D. & LAFONTAINE, J. (1993) Riemannian Geometry. Berlin: Springer
12. HELGASON, K. (1979) Differential Geometry, Lie Groups, and Symmetric Spaces. New York: Academic.
13. HIRSCH, M. W. (1976) Differential Topology. Berlin: Springer.
14. ISERLES, A. (2001) On Cayley-transform methods for the discretization of Lie-group equations. Foundations Comput. Math., 1, 129-160.
15. ISERLES, A., MUNTHE-KAAS, H. Z., NØRSET, S. P. & ZANNA, A. (2001) Lie-group methods. Acta Numerica, 9, 215-365.
16. KIM, M.-H. On computational complexity of the Euler type algorithms for the roots of complex polynomials. Thesis, City University of New York Graduate Center, 1985.
17. KIM, M.-H. (1988) On approximate zeroes and root finding algorithms for a complex polynomial. Math. Comput., 51, 707-719.
18. MALAJOVICH, G. (1994) On generalized Newton algorithms. Theoretical Computer Sci., 133, 65-84.
19. MALAJOVICH, G. & ROJAS, J. M. (2002) Polynomial systems and the momentum map. Proceedings Smalefest 2000. (Cucker & Rojas, eds). Singapore: World Scientific, pp. 251-266.
20. MUNTHE-KAAS, H. Z., QUISPEL, G. R. W. & ZANNA, A. (2001) Polar decompositions on Lie groups with involutive automorphisms. Foundations Comput. Math., 1, 297-324.
21. O'NEILL, B. (1983) Semi-Riemannian Geometry. New York: Academic.
22. ORTEGA, J. & RHEINBOLDT, V. (1968) Numerical Solutions of Nonlinear Problems. Philadelphia, PA: SIAM.
23. OSTROWSKI, A. (1976) Solutions of Equations in Euclidean and Banach Spaces. New York: Academic.
24. OWREN, B. & WELFERT, B. (1996) The Newton Iteration on Lie Groups. Preprint.
25. OWREN, B. & MARTHINSEN, A. (1999) Integration methods based on canonical coordinates of the second kind. Technical Report Numerics 5/1999 Norwegian University of Science and Technology. Trondheim: Norway. Numer. Math., 87, 737-790.
26. RAYLEIGH & STRUTT, J. W. (1899) On the calculation of the frequency of vibration of a system in its gravest mode, with examples from hydrodynamics. The Philosophical Magazine, 47, 556-572.
27. SHUB, M. (1986) Some remarks on dynamical systems and numerical analysis. Dynamical Systems and Partial Differential Equations, Proceedings of VII ELAM. (L. Lara-Carrero & J. Lewowicz, eds). Caracas: Equinoccio, Universidad Simon Bolivar, pp. 69-92.
28. SHUB, M. (1993) Some remarks on Bezout's theorem and complexity. From Topology to Computation: Proceedings of the Smalefest. (J. E. Marsden, M. W. Hirsch & M. Shub, eds). Berlin: Springer, pp. 443-455.
29. SHUB, M. & SMALE, S. (1993a) Complexity of Bézout's theorem I: geometric aspects. J. Amer. Math. Soc., 6, 459-501.
30. SHUB, M. & SMALE, S. (1993b) Complexity of Bézout's theorem II: volumes and probabilities. Computational Algebraic Geometry (F. Eyssette & A. Galligo, eds). Progress in Mathematics 109. Birkhäuser, pp. 267-285.
31. SHUB, M. & SMALE, S. (1993c) Complexity of Bézout's theorem III: condition number and packing. J. Complexity, 9, 4-14.
32. SHUB, M. & SMALE, S. (1994) Complexity of Bézout's theorem V: polynomial time. Theo. Computer Sci., 133, 141-164.
33. SHUB, M. & SMALE, S. (1996) Complexity of Bézout's theorem IV: probability of success, extensions. SIAM J. Numer. Anal., 33, 128-148.
34. SMALE, S. (1985) On the efficiency of algorithms of analysis. Bull. AMS, 13, 87-121.
35. SMALE, S. (1986a) Algorithms for solving equation. Proceedings of the International Congress of Mathematicians. AMS, pp. 172-195.
36. SMALE, S. (1986b) Newton's method estimates from data at one point. The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics. (R. Ewing, K. Gross & C. Martin, eds). Berlin: Springer.
37. SMITH, S. (1994) Optimization techniques on Riemannian manifolds. Fields Institute Communications 3. AMS, pp. 113-146.
38. UDRISTE, C. (1994) Convex Functions and Optimization Methods on Riemannian Manifolds. Dordreht: Kluwer.