An acceleration method for computing the generalized eigenvalue problem on a parallel computer
From MaRDI portal
Publication:756366
DOI10.1016/0024-3795(91)90019-SzbMATH Open0722.65017MaRDI QIDQ756366FDOQ756366
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Efficient implementation of Jacobi's diagonalization method on the DAP
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Perturbation theorems for the generalized eigenvalue problem
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- A direct method for completing eigenproblem solutions on a parallel computer
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation
- Data-flow algorithms for parallel matrix computation
- On the Schur Decomposition of a Matrix for Parallel Computation
Cited In (5)
Recommendations
- On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation π π
- Title not available (Why is that?) π π
- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
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)