Fast Computation of Spectral Projectors of Banded Matrices
From MaRDI portal
Publication:5358302
DOI10.1137/16M1087278zbMath1373.65023arXiv1608.01164MaRDI QIDQ5358302
Publication date: 20 September 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01164
spectral gapnumerical experimentmatrix functionshierarchical matricesdata-sparse approximationspectral projectorsHalley algorithmsymmetric banded matrices
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (6)
hm-toolbox: MATLAB Software for HODLR and HSS Matrices ⋮ On the decay of the off-diagonal singular values in cyclic reduction ⋮ Non-Toeplitz decay bounds for inverses of Hermitian positive definite tridiagonal matrices ⋮ Zolotarev Iterations for the Matrix Square Root ⋮ On uniform connectivity of algebraic matrix sets ⋮ Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- On the QR decomposition of \({\mathcal {H}}\)-matrices
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Fast spectral projection algorithms for density-matrix computations
- \(\mathcal H\)-matrix approximation for the operator exponential with applications
- Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum
- The eigenvalue problem for the 2D Laplacian in \({\mathcal H}\)-matrix arithmetic and application to the heat and wave equation
- Tridiagonalization of a symmetric band matrix
- Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions
- Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
- Computing All or Some Eigenvalues of Symmetric $\mathcal{H}_{\ell}$-Matrices
- Hierarchical Matrices: Algorithms and Analysis
- Matrices with Hierarchical Low-Rank Structures
- The university of Florida sparse matrix collection
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares Problems
- The design and implementation of the MRRR algorithm
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- Algorithms for the regularization of ill-conditioned least squares problems
- A framework for symmetric band reduction
- A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
- On the Singular Values of Matrices with Displacement Structure
- Data-sparse approximation to the operator-valued functions of elliptic operator
- Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem
- Decay Properties of Spectral Projectors with Applications to Electronic Structure
- High-Performance Solvers for Dense Hermitian Eigenproblems
- Approximation of 1/x by exponential sums in [1, ∞)
This page was built for publication: Fast Computation of Spectral Projectors of Banded Matrices
