An acceleration method for computing the generalized eigenvalue problem on a parallel computer
From MaRDI portal
Publication:756366
Recommendations
- On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation
- scientific article; zbMATH DE number 1113885
- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
- scientific article; zbMATH DE number 1526541
- scientific article; zbMATH DE number 434520
Cites work
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- A direct method for completing eigenproblem solutions on a parallel computer
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Data-flow algorithms for parallel matrix computation
- Efficient implementation of Jacobi's diagonalization method on the DAP
- On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation
- On the Schur Decomposition of a Matrix for Parallel Computation
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- Perturbation theorems for the generalized eigenvalue problem
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
Cited in
(5)- Acceleration of a two-grid method for eigenvalue problems
- Some acceleration techniques for calculating the eigenvalues of normal Toeplitz matrices
- scientific article; zbMATH DE number 7468269 (Why is no real title available?)
- scientific article; zbMATH DE number 1092853 (Why is no real title available?)
- scientific article; zbMATH DE number 822157 (Why is no real title available?)
This page was built for publication: An acceleration method for computing the generalized eigenvalue problem on a parallel computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756366)
