A new vector field method for eigen-decomposition of symmetric matrices

DOI10.1016/j.na.2006.12.022zbMath1141.65027MaRDI QIDQ2474357

Yanyan Li

Publication date: 6 March 2008

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2006.12.022

zbMATH Keywords

performance; algorithms; convergence; eigenvalue; numerical examples; QR method; Lanczos algorithm; power method; complexity bounds; vector field approach; divide-and-conquer approaches; LP interior point methods; recursive vector field algorithms

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

15A18: Eigenvalues, singular values, and eigenvectors

37C10: Dynamics induced by flows and semiflows

Cites Work

• A new polynomial-time algorithm for linear programming
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Eigenvalue computation in the 20th century
• The Centroid Decomposition: Relationships between Discrete Variational Decompositions and SVDs
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Numerical Optimization
• Matrices, Vector Spaces, and Information Retrieval
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• Using Linear Algebra for Intelligent Information Retrieval
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Complexity of the gravitational method for linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item