A homotopy algorithm for a symmetric generalized eigenproblem

DOI10.1007/BF02142745zbMath0779.65024MaRDI QIDQ1208063

Tien-Yien Li, Kuiyuan Li

Publication date: 16 May 1993

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

comparison of methods; homotopy continuation; numerical examples; parallel computation; generalized eigenvalue problem; multiprocessors; divide and conquer strategy; homotopy algorithm; eigenpairs; eigen-curves; real symmetric matrix pencil

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65Y05: Parallel numerical computation

Related Items

A convex geometric approach to counting the roots of a polynomial system, An algorithm for the generalized symmetric tridiagonal eigenvalue problem, A fully parallel method for the singular eigenvalue problem

Uses Software

• EISPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple application of the homotopy method to symmetric eigenvalue problems
• An algorithm for the symmetric generalized eigenvalue problem
• Homotopy method for generalized eigenvalue problems \(Ax=\lambda Bx\)
• A note on the homotopy method for linear algebraic eigenvalue problems
• Homotopy algorithm for symmetric eigenvalue problems
• Matrix eigensystem routines - EISPACK guide. 2nd ed
• Numerical Solution of a Class of Deficient Polynomial Systems
• Homotopy Method for General $\lambda $-Matrix Problems
• On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
• Solving Eigenvalue Problems of Real Nonsymmetric Matrices with Real Homotopies
• $Ax = \lambda Bx$ and the Generalized Eigenproblem
• An Algorithm for Symmetric Tridiagonal Eigenproblems: Divide and Conquer with Homotopy Continuation
• An Algorithm for the Ill-Conditioned Generalized Eigenvalue Problem