Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices

DOI10.1137/S1064827501399432zbMath1038.65031OpenAlexW2045073555MaRDI QIDQ4442472

Robert C. Ward, Richard P. Muller, Wilfried N. Gansterer, William A. III Goddard

Publication date: 20 January 2004

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

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

zbMATH Keywords

numerical exampleseigenvalue problemdivide-and-conquer methodblock tridiagonal matrixapproximate eigenpairs

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Graph signal processing on dynamic graphs based on temporal-attention product ⋮ Equivalence of fourth order boundary value problems and matrix eigenvalue problems ⋮ Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations ⋮ Parallel block tridiagonalization of real symmetric matrices ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths ⋮ Matrix representations of fourth-order boundary value problems with coupled or mixed boundary conditions

Uses Software

• LAPACK

This page was built for publication: Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices