An Algorithm for Symmetric Tridiagonal Eigenproblems: Divide and Conquer with Homotopy Continuation

DOI10.1137/0914046zbMath0790.65032OpenAlexW2077915982MaRDI QIDQ4695056

Kuiyuan Li, Tien-Yien Li

Publication date: 23 June 1994

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0914046

zbMATH Keywords

numerical resultshomotopy continuationeigenvaluesparallel computationeigenvectorsnumerical comparisonssymmetric tridiagonal matrixdivide and conquer algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (6)

An algorithm for the generalized symmetric tridiagonal eigenvalue problem ⋮ Parallel homotopy algorithm for symmetric large sparse eigenproblems ⋮ A fully parallel method for the singular eigenvalue problem ⋮ Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators ⋮ A homotopy algorithm for a symmetric generalized eigenproblem ⋮ A Homotopy Method for Finding All Solutions of a Multiparameter Eigenvalue Problem

Uses Software

• LAPACK
• EISPACK

This page was built for publication: An Algorithm for Symmetric Tridiagonal Eigenproblems: Divide and Conquer with Homotopy Continuation