Cost-optimal Gaussian Elimination Algorithm on RCC-FULL

DOI10.1080/10637190310001633646MaRDI QIDQ4820801zbMATH OpenOpenAlexFDO

Authors

Publication date 1 October 2004

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

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

zbMATH Keywords

networkGaussian eliminationcomplexityparallel algorithmsRCC-FULL

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)

Recommendations

• scientific article; zbMATH DE number 1253960
• On the Performance of the Minimum Degree Ordering for Gaussian Elimination
• scientific article; zbMATH DE number 3876585
• On the parallel complexity of Gaussian elimination with pivoting
• On the robustness of Gaussian elimination with partial pivoting
• Optimal scheduling algorithms for parallel Gaussian elimination
• scientific article; zbMATH DE number 4084838
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
• scientific article; zbMATH DE number 3999131

Cited in

(1)

• RCC-FULL

This page was built for publication: Cost-optimal Gaussian Elimination Algorithm on RCC-FULL

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