Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses

DOI10.1080/10637190410001700604zbMath1066.65034OpenAlexW2005419672MaRDI QIDQ4665363

Keqin Li

Publication date: 11 April 2005

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637190410001700604

zbMATH Keywords

characteristic polynomialscalabilityrankdeterminantinversetime complexityparallel computationspowersLU-factorizationprocessor arrayQR-factorizationmatrix computationcost optimalitylinear speedupoptical busastest sequential matrix multiplication algorithmdistributed memory parallel computing systems

Mathematics Subject Classification ID

Cites Work

• Matrix multiplication via arithmetic progressions
• Complexity of parallel matrix computations
• Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
• Fast Parallel Matrix Inversion Algorithms

This page was built for publication: Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses