An acceleration method for computing the generalized eigenvalue problem on a parallel computer

DOI10.1016/0024-3795(91)90019-SzbMath0722.65017MaRDI QIDQ756366

D. Kharzeev

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Convergenceparallel computinggeneralized eigenvalue problemJacobi methodacceleration method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Cites Work

• Efficient implementation of Jacobi's diagonalization method on the DAP
• 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
• Perturbation theorems for the generalized eigenvalue problem
• On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation
• 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
• Data-flow algorithms for parallel matrix computation
• On the Schur Decomposition of a Matrix for Parallel Computation
• On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
• An Algorithm for Generalized Matrix Eigenvalue Problems

This page was built for publication: An acceleration method for computing the generalized eigenvalue problem on a parallel computer