Partitioned triangular tridiagonalization
DOI10.1145/1916461.1916462zbMATH Open1365.65074OpenAlexW2006742127WikidataQ113310468 ScholiaQ113310468MaRDI QIDQ2989124FDOQ2989124
Authors: Miroslav Rozložník, Gil Shklarski, Sivan Toledo
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1916461.1916462
Recommendations
- Reduction of a General Matrix to Tridiagonal Form
- scientific article; zbMATH DE number 741170
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
- Communication-avoiding symmetric-indefinite factorization
symmetric indefinite matricestridiagonalizationrecursive factorizationsAasen's tridagonalizationParlett-Reid tridagonalizationpartitioned factorizations
Cited In (6)
- Linear algebra software for large-scale accelerated multicore computing
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- Fissioned triangular schemes via the cross-ratio
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Communication-avoiding symmetric-indefinite factorization
- Hierarchical Comprehensive Triangular Decomposition
Uses Software
This page was built for publication: Partitioned triangular tridiagonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989124)