An input/output efficient algorithm for Hessenberg reduction
From MaRDI portal
Publication:5207035
Recommendations
- A Hessenberg Reduction Algorithm for Rank Structured Matrices
- A parallel algorithm for the reduction of a nonsymmetric matrix to block upper-Hessenberg form
- Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
- Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form
- Reduction of a General Matrix to Tridiagonal Form
Cites work
- scientific article; zbMATH DE number 1805736 (Why is no real title available?)
- scientific article; zbMATH DE number 1792107 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 910869 (Why is no real title available?)
- scientific article; zbMATH DE number 1424322 (Why is no real title available?)
- scientific article; zbMATH DE number 5499319 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- A framework for symmetric band reduction
- A parallel algorithm for the reduction of a nonsymmetric matrix to block upper-Hessenberg form
- Algorithms for parallel memory, I: Two-level memories
- Block reduction of matrices to condensed forms for eigenvalue computations
- Efficient parallel reduction to bidiagonal form.
- Improving the performance of reduction to Hessenberg form
- Minimizing communication in numerical linear algebra
- Numerical Linear Algebra for High-Performance Computers
- Parallel block tridiagonalization of real symmetric matrices
- Parallel reduction of banded matrices to bidiagonal form
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- Reduction to condensed form for the eigenvalue problem on distributed memory architectures
- Similarity reduction of a general matrix to Hessenberg form
- The buffer tree: A technique for designing batched external data structures
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
- Using Level 3 BLAS in Rotation-Based Algorithms
Cited in
(2)
This page was built for publication: An input/output efficient algorithm for Hessenberg reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207035)