Optimization of the Multishift QR Algorithm with Coprocessors for Non-Hermitian Eigenvalue Problems
DOI10.4208/EAJAM.300510.250311AzbMATH Open1287.65026OpenAlexW2312343590MaRDI QIDQ5406891FDOQ5406891
Authors: Takafumi Miyata, Yusaku Yamamoto, Takashi Uneyama, Yoshimasa Nakamura, Shao-Liang Zhang 
Publication date: 4 April 2014
Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/eajam.300510.250311a
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
eigenvaluesnumerical examplesperformance modelingmultishift QR algorithmbulge-chasingdense, large, non-Hermitian matrix
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
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)
