Parallel quadrant interlocking factorization on hypercube computers

DOI10.1016/0167-8191(90)90033-6MaRDI QIDQ919737zbMATH OpenOpenAlexFDO

Authors I. García, Javier D. Bruguera, E. L. Zapata, J. J. Merelo

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90033-6

zbMATH Keywords

complexitycomputer language Cefficiencyhypercube computer architectureparallel computationquadrant interlocking factorization methodWZ factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Review text

Starting from the WZ factorization of matrices the quadrant interlocking factorization method (QIF) for solving systems of linear equations is presented in a brief summary. Next the authors discuss those aspects of hypercube computer architecture that are essential for their numerical application and present a general technique, how to decompose a sequential algorithm into parallel processes on a hypercube. They also introduce an extension of the computer language C for programming their hypercube. Applying those techniques they develop the parallel WZ and QIF algorithms and give their code listing. The paper concludes with a complexity analysis of the algorithm and a discussion of the effect of the hypercube dimension on efficiency.

Recommendations

• QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
• A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
• Parallel complexity of Householder QR factorization
• Fast Parallel Algorithms for QR and Triangular Factorization
• A parallel QR-factorization/solver of quasiseparable matrices
• Efficient parallel algorithm for quasi pentadiagonal systems on a hypercube
• Parallel complexities and computations of cholesky's decomposition and QR factorization
• scientific article; zbMATH DE number 3947528
• On the existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems

Cited in

(10)

• The solution of linear systems by the QIF algorithms on a wavefront array processor
• The block WZ factorization
• The parallel tiled WZ factorization algorithm for multicore architectures
• QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
• scientific article; zbMATH DE number 4072246 (Why is no real title available?)
• scientific article; zbMATH DE number 176183 (Why is no real title available?)
• Communication analysis of the PIE and QIF algorithms on distributed memory architecture
• PARALLEL METHOD FOR SOLVING SINGULARLY PERTURBED BOUNDARY VALUE PROBLEMS
• On the existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
• Part III Matrix decomposition methods for parallel computers

This page was built for publication: Parallel quadrant interlocking factorization on hypercube computers

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