Computing All or Some Eigenvalues of Symmetric $\mathcal{H}_{\ell}$-Matrices

DOI10.1137/100815323zbMath1387.65034OpenAlexW2036403858WikidataQ115224042 ScholiaQ115224042MaRDI QIDQ2882797

Peter Benner, Thomas Mach

Publication date: 7 May 2012

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

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

zbMATH Keywords

eigenvaluessymmetric hierarchical matricesslicing the spectrum\(\mathcal{H}_{\ell}\)-matrices

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 (8)

SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ The LR Cholesky algorithm for symmetric hierarchical matrices ⋮ Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum ⋮ A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices ⋮ Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations ⋮ Fast Computation of Spectral Projectors of Banded Matrices ⋮ Matrices with Hierarchical Low-Rank Structures ⋮ Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions

Uses Software

• LAPACK
• hlib

This page was built for publication: Computing All or Some Eigenvalues of Symmetric $\mathcal{H}_{\ell}$-Matrices