Parallel block tridiagonalization of real symmetric matrices
From MaRDI portal
(Redirected from Publication:436780)
Recommendations
- Block tridiagonalization of "effectively" sparse symmetric matrices
- scientific article; zbMATH DE number 741170
- A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
- Block reduction of matrices to condensed forms for eigenvalue computations
- A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
Cites work
- scientific article; zbMATH DE number 1049347 (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 Symmetric Tridiagonal Eigenproblem
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A framework for symmetric band reduction
- A parallel symmetric block-tridiagonal divide-and-conquer algorithm
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Block reduction of matrices to condensed forms for eigenvalue computations
- Block tridiagonalization of "effectively" sparse symmetric matrices
- Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
- Global convergence of tridiagonal QR algorithm with origin shifts
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- ScaLAPACK Users' Guide
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The WY Representation for Products of Householder Matrices
Cited in
(11)- Block triangularization of skew-symmetric matrices
- A parallel Householder tridiagonalization stratagem using scattered square decomposition
- Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Block tridiagonalization of "effectively" sparse symmetric matrices
- An input/output efficient algorithm for Hessenberg reduction
- Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing
- Some properties of the block matrices in the parallel decomposition-type relaxation methods
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- A family of permutations for concurrent factorization of block tridiagonal matrices
- A block decomposition method for block quindiagonal matrices
This page was built for publication: Parallel block tridiagonalization of real symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436780)