Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
From MaRDI portal
Publication:2805015
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
Cites work
- scientific article; zbMATH DE number 432841 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1064576 (Why is no real title available?)
- scientific article; zbMATH DE number 778080 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A Fast Solver for HSS Representations via Sparse Matrices
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- A fast algorithm for particle simulations
- A fast algorithm for the inversion of general Toeplitz matrices
- A fast randomized eigensolver with structured LDL factorization update
- A note on eigenvalues of perturbed Hermitian matrices
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Computing all or some eigenvalues of symmetric \(\mathcal{H}_{\ell}\)-matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Displacement ranks of matrices and linear equations
- Efficient structured multifrontal factorization for general large sparse matrices
- Eigenvalues of perturbed Hermitian matrices
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast algorithms for hierarchically semiseparable matrices
- Fast sparse selected inversion
- Introduction to hierarchical matrices with applications.
- Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
- On Computations with Dense Structured Matrices
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- On the complexity of some hierarchical structured matrix algorithms
- Perturbation in eigenvalues of a symmetric tridiagonal matrix
- Perturbations in eigenvalues
- Rank-one modification of the symmetric eigenproblem
- Refined perturbation bounds for eigenvalues of Hermitian and non-Hermitian matrices
- Relative perturbation bounds for eigenvalues of symmetric positive definite diagonally dominant matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Some Modified Matrix Eigenvalue Problems
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Transformations of matrix structures work again
Cited in
(15)- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Fast computation of spectral projectors of banded matrices
- 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
- Analytical low-rank compression via proxy point selection
- A fast contour-integral eigensolver for non-Hermitian matrices
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Fast algorithms using orthogonal polynomials
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- A fast randomized eigensolver with structured LDL factorization update
- Matrices with hierarchical low-rank structures
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
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)
