One-dimensional processor arrays for linear algebraic problems

DOI10.1049/IP-CDT:19951531MaRDI QIDQ4844175zbMATH OpenOpenAlexFDO

Authors R. Wyrzkowski, J. S. Kanevski, Henryk Piech

Publication date 18 February 1996

Published in IEE Proceedings - Computers and Digital Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/ip-cdt:19951531

zbMATH Keywords

Cholesky algorithmGauss-Jordan algorithmlinear processor arraysparallel computation

Mathematics Subject Classification ID

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

Recommendations

• Solving systems of linear algebraic equations on array processors
• scientific article; zbMATH DE number 426143
• Parallel programming of linear processor arrays
• Part II A systolic array for numerical linear algebra
• On multidimensional arrays of processors
• scientific article; zbMATH DE number 3911707
• Processor Efficient Parallel Solution of Linear Systems of Equations
• scientific article; zbMATH DE number 3938449

Cited in

(1)

• On high-speed computing with a programmable linear array

This page was built for publication: One-dimensional processor arrays for linear algebraic problems

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