A systolic array architecture for QR decomposition of block structured sparse systems

DOI10.1016/0167-8191(94)90124-4MaRDI QIDQ1334870zbMATH OpenOpenAlexFDO

Authors Chunru Wan, D. J. Evans

Publication date 26 September 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90124-4

zbMATH Keywords

parallel computationQR decompositionsparse matrixsystolic array algorithm

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Review text

A systolic architecture to compute the QR decomposition of a block structured sparse matrix is discussed. If the size of the problem is very large, then its parallel computation is very important. The systolic array algorithm is simulated by the parallel programming language OCCAM 2 in a single transputer.

Recommendations

• scientific article; zbMATH DE number 3879990
• Systolic Networks for Orthogonal Decompositions
• Systolic computation of QZ matrix decomposition
• scientific article; zbMATH DE number 1226271
• scientific article; zbMATH DE number 3894356

Cited in

(6)

• Effective processor architecture for matrix decomposition
• A vectorized systolic array for parallel weight extraction of block RLS
• Systolic array for schur complement computation
• Systolic computation of QZ matrix decomposition
• Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm
• scientific article; zbMATH DE number 2086818 (Why is no real title available?)

This page was built for publication: A systolic array architecture for QR decomposition of block structured sparse systems

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