Solving the generalized eigenvalue problem on a synchronous linear processor array

DOI10.1016/0167-8191(86)90032-3MaRDI QIDQ1079332zbMATH OpenOpenAlexFDO

Authors Daniel Boley

Publication date 1986

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(86)90032-3

zbMATH Keywords

generalized eigenvalue problemlinear processor arrayMIMD computerparallel algorithmQZ algorithmsynchronous

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

The implementation of the QZ algorithm for the \((A-\lambda B)x=0\) eigenvalue problem on a linear array of processors is discussed and it is shown how a correct order of speed up can be obtained.

Recommendations

• The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
• scientific article; zbMATH DE number 1247167
• scientific article; zbMATH DE number 3880005
• scientific article; zbMATH DE number 1526541
• A parallel QR algorithm for the nonsymmetric eigenvalue problem

Cited in

(4)

• A parallel QR algorithm for the nonsymmetric eigenvalue problem
• Implementation of the Generalized WZ Factorization on a Wavefront Array Processor
• A Householder-Based Algorithm for Hessenberg-Triangular Reduction
• Solving Eigenvalue and Singular Value Problems on an Undersized Systolic Array

Describes a project that uses

Uses Software

• EISPACK

This page was built for publication: Solving the generalized eigenvalue problem on a synchronous linear processor array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079332)