A divide-and-conquer method for the tridiagonal generalized eigenvalue problem

DOI10.1016/S0377-0427(97)00152-0zbMath1007.65024MaRDI QIDQ1378998

A. Fasse, Edwin Langmann, Ludwig Elsner

Publication date: 9 March 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

generalized eigenvalue problemdivide-and-conquer methodtridiagonal symmetric matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

Fast algorithms using orthogonal polynomials ⋮ Simultaneous band reduction of two symmetric matrices

Cites Work

• Unnamed Item
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Rank-one modification of the symmetric eigenproblem
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem

This page was built for publication: A divide-and-conquer method for the tridiagonal generalized eigenvalue problem