Optimization of the Multishift QR Algorithm with Coprocessors for Non-Hermitian Eigenvalue Problems
From MaRDI portal
Publication:5406891
Recommendations
- Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
- A parallel QR algorithm for the nonsymmetric eigenvalue problem
- Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality
- QR -like algorithms for the nonsymmetric eigenvalue problem
- scientific article; zbMATH DE number 1330403
- Parallel algorithms for QR decomposition on a shared memory multiprocessor
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices
- A high performance parallelization scheme for the Hessenberg double shift QR algorithm
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
This page was built for publication: Optimization of the Multishift QR Algorithm with Coprocessors for Non-Hermitian Eigenvalue Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406891)