Accelerating Computation of Eigenvectors in the Dense Nonsymmetric Eigenvalue Problem
From MaRDI portal
Recommendations
- Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem
- Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors
- An efficient implementation of parallel eigenvalue computation for massively parallel processing
- scientific article; zbMATH DE number 434519
- A sparse nonsymmetric eigensolver for distributed memory architectures
Cites work
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
- CQF Magma package
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
- The multishift QR algorithm. II: Aggressive early deflation
- The WY Representation for Products of Householder Matrices
Cited in
(7)- Fast accurate eigenvalue methods for graded positive definite matrices
- Breaking Van Loan’s Curse: A Quest forStructure-Preserving Algorithms for Dense Structured Eigenvalue Problems
- Parallel Diagonalization Performance on High-Performance Computers
- Efficient Computation of Many Eigenvector Derivatives Using Dynamic Flexibility Method
- scientific article; zbMATH DE number 7468269 (Why is no real title available?)
- Material coherence from trajectories via Burau eigenanalysis of braids
- Some acceleration techniques for calculating the eigenvalues of normal Toeplitz matrices
This page was built for publication: Accelerating Computation of Eigenvectors in the Dense Nonsymmetric Eigenvalue Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487406)
