An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
From MaRDI portal
Publication:2007234
Recommendations
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- scientific article; zbMATH DE number 278836
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (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 Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- A Singular Value Decomposition Updating Algorithm for Subspace Tracking
- A bibliography on semiseparable matrices
- A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A framework for symmetric band reduction
- A parallel symmetric block-tridiagonal divide-and-conquer algorithm
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Accurate Singular Values of Bidiagonal Matrices
- Algorithm 807
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
- Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
- Electronic Structure
- Fast algorithms for hierarchically semiseparable matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- New efficient and robust HSS Cholesky factorization of SPD matrices
- On a new class of structured matrices
- On the Compression of Low Rank Matrices
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- Randomized algorithms for the low-rank approximation of matrices
- Rang revealing QR factorizations
- Rank-one modification of the symmetric eigenproblem
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The University of Florida sparse matrix collection
- Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem
- Updating the singular value decomposition
Cited in
(8)- scientific article; zbMATH DE number 833711 (Why is no real title available?)
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Proposal and efficient implementation of multiple division divide-and-conquer algorithm for SVD
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- On multisplitting methods for band matrices
- Divide-and-conquer methods for functions of matrices with banded or hierarchical low-rank structure
This page was built for publication: An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007234)
