Cost-optimal Gaussian Elimination Algorithm on RCC-FULL

DOI10.1080/10637190310001633646zbMATH Open1054.65027OpenAlexW1982312866MaRDI QIDQ4820801

Author name not available (Why is that?)

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

networkcomplexityGaussian eliminationparallel algorithmsRCC-FULL

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• On the Performance of the Minimum Degree Ordering for Gaussian Elimination 👍 👎
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems 👍 👎

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)