An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems

DOI10.1145/513001.513004zbMath1072.65050OpenAlexW2054567154WikidataQ113309778 ScholiaQ113309778MaRDI QIDQ5461029

Wilfried N. Gansterer, Richard P. Muller, Robert C. Ward

Publication date: 21 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513001.513004

zbMATH Keywords

algorithmnumerical exampleseigenvalueseigenvectorsquantum chemistryarithmetic complexitydivide-and-conquer methodblock-tridiagonal matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Graph signal processing on dynamic graphs based on temporal-attention product ⋮ Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths

Uses Software

• LAPACK

This page was built for publication: An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems