SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
From MaRDI portal
Publication:5038407
DOI10.1137/21M1438633zbMath1501.65019OpenAlexW4296686646MaRDI QIDQ5038407
Publication date: 30 September 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1438633
divide-and-conquer methodrank-structured matrixlocal shiftingshifted secular equationsuperfast eigenvalue decompositiontriangular fast multipole method
Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- A fast algorithm for the inversion of general Toeplitz matrices
- Implicit double shift \(QR\)-algorithm for companion matrices
- Recurrence relations and fast algorithms
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- Rank-one modification of the symmetric eigenproblem
- The prolate matrix
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A fast direct solver for boundary integral equations in two dimensions
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- A Matrix Version of the Fast Multipole Method
- Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions
- On the Stability of Some Hierarchical Rank Structured Matrix Algorithms
- Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- Computing All or Some Eigenvalues of Symmetric $\mathcal{H}_{\ell}$-Matrices
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- Divide and Conquer Method for Eigenstructure of Quasiseparable Matrices Using Zeroes of Rational Matrix Functions
- A Fast Randomized Eigensolver with Structured LDL Factorization Update
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- LAPACK Users' Guide
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A fast spectral divide‐and‐conquer method for banded matrices
- Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure
- Analytical Low-Rank Compression via Proxy Point Selection
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- Randomized Sparse Direct Solvers
- A Fast Solver for HSS Representations via Sparse Matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Some Modified Matrix Eigenvalue Problems
- A fast algorithm for particle simulations
This page was built for publication: SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
