The constrained Newton method on a Lie group and the symmetric eigenvalue problem

DOI10.1016/0024-3795(95)00171-9zbMath0864.65032OpenAlexW2105305988WikidataQ115364306 ScholiaQ115364306MaRDI QIDQ2564923

Robert Mahony

Publication date: 3 June 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00171-9

zbMATH Keywords

numerical examplesLie groupquadratic convergenceNewton methodQR algorithmsymmetric eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10)

Related Items

\(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds, Equilibrium problems on Riemannian manifolds with applications, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, Kantorovich's theorem for Newton's method on Lie groups, Local convergence of the Newton’s method in two step nilpotent Lie groups, Convergence criteria of Newton's method on Lie groups, A new matrix maximization model for computing ratios of generalized singular values from high-order GSVD, The continuous-time Rayleigh quotient flow on the sphere, Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints, Convergence of Newton's method for sections on Riemannian manifolds, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Local convergence of Newton's method on Lie groups and uniqueness balls, Extending the applicability of Newton's method on Lie groups, Local convergence of Newton's method on the Heisenberg group, Smale's point estimate theory for Newton's method on Lie groups, Unnamed Item, The constrained Newton method on a Lie group and the symmetric eigenvalue problem, Newton-type methods for simultaneous matrix diagonalization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamical systems that perform the singular value decomposition
• Balanced realizations via gradient flow techniques
• Hamiltonian structure of dynamical systems which solve linear programming problems
• Conjugate loci of constant order
• Global convergence of tridiagonal QR algorithm with origin shifts
• The constrained Newton method on a Lie group and the symmetric eigenvalue problem
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Complexity of Bezout's Theorem I: Geometric Aspects
• Numerical Gradient Algorithms for Eigenvalue and Singular Value Calculations
• Recursive Algorithms for Solving a Class of Nonlinear Matrix Equations with Applications to Certain Sensitivity Optimization Problems
• Gradient algorithms for principal component analysis