Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
From MaRDI portal
Publication:2805015
DOI10.1137/15M1018812zbMATH Open1338.65104OpenAlexW2347093389MaRDI QIDQ2805015FDOQ2805015
James Vogel, Jianlin Xia, Stephen Cauley, Venkataramanan Balakrishnan
Publication date: 9 May 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1018812
Recommendations
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- A fast randomized eigensolver with structured LDL factorization update
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- Accurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices
eigenvalue decompositioncompressionlinear complexityrank structurestructured perturbation analysissuperfast divide-and-conquer
Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Fast algorithms for hierarchically semiseparable matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A fast algorithm for particle simulations
- Rank-one modification of the symmetric eigenproblem
- Construction and arithmetics of \(\mathcal H\)-matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Some Modified Matrix Eigenvalue Problems
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A fast algorithm for the inversion of general Toeplitz matrices
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A Fast Solver for HSS Representations via Sparse Matrices
- Introduction to hierarchical matrices with applications.
- Computing all or some eigenvalues of symmetric \(\mathcal{H}_{\ell}\)-matrices
- On Computations with Dense Structured Matrices
- Title not available (Why is that?)
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Title not available (Why is that?)
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A note on eigenvalues of perturbed Hermitian matrices
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- Displacement ranks of matrices and linear equations
- Perturbation in eigenvalues of a symmetric tridiagonal matrix
- Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian Matrices
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- On the complexity of some hierarchical structured matrix algorithms
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Transformations of matrix structures work again
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- Relative Perturbation Bounds for Eigenvalues of Symmetric Positive Definite Diagonally Dominant Matrices
- Eigenvalues of perturbed Hermitian matrices
- Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
- Title not available (Why is that?)
- Perturbations in eigenvalues
- Fast Sparse Selected Inversion
- A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations
- A Fast Randomized Eigensolver with Structured LDL Factorization Update
Cited In (14)
- Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
- Matrices with Hierarchical Low-Rank Structures
- Analytical Low-Rank Compression via Proxy Point Selection
- All-at-once method for variable-order time fractional diffusion equations
- Breaking Van Loan’s Curse: A Quest forStructure-Preserving Algorithms for Dense Structured Eigenvalue Problems
- An efficient, memory-saving approach for the Loewner framework
- Super-exponentially convergent parallel algorithm for eigenvalue problems with fractional derivatives
- hm-toolbox: MATLAB Software for HODLR and HSS Matrices
- Fast algorithms using orthogonal polynomials
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
- Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction
- Fast Computation of Spectral Projectors of Banded Matrices
- A stable matrix version of the fast multipole method: stabilization strategies and examples
This page was built for publication: Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805015)
