Computing all or some eigenvalues of symmetric H_-matrices
DOI10.1137/100815323zbMATH Open1387.65034OpenAlexW2036403858WikidataQ115224042 ScholiaQ115224042MaRDI QIDQ2882797FDOQ2882797
Authors: P. 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
Recommendations
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (11)
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations
- Fast computation of spectral projectors of banded matrices
- Computing all Pairs (λ,μ) Such That λ is a Double Eigenvalue of A+μB
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- A fast contour-integral eigensolver for non-Hermitian matrices
- Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum
- A fast randomized eigensolver with structured LDL factorization update
- Matrices with hierarchical low-rank structures
- The LR Cholesky algorithm for symmetric hierarchical matrices
Uses Software
This page was built for publication: Computing all or some eigenvalues of symmetric \(\mathcal{H}_{\ell}\)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882797)
