Gaussian elimination with pivoting on hypercubes
From MaRDI portal
For the Gaussian elimination algorithm on SIMD hypercube machines partial and complete pivoting is studied. The program is written in an extension suitable for hypercube computers of the ``C language. The evaluation of the complexity and running time as a function of the decomposition of the original matrix in submatrices distributed in local processors is performed.
Recommendations
Cited in
(14)- Gaussian elimination with partial pivoting and load balancing on a multiprocessor
- scientific article; zbMATH DE number 5872172 (Why is no real title available?)
- Analysis of Pairwise Pivoting in Gaussian Elimination
- scientific article; zbMATH DE number 4215247 (Why is no real title available?)
- scientific article; zbMATH DE number 4092650 (Why is no real title available?)
- A PARALLEL ALGORITHM FOR HOUSEHOLDER'S TRID1AGONALIZATION OF A SYMMETRIC MATRIX
- UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
- scientific article; zbMATH DE number 3994887 (Why is no real title available?)
- Gaussian Elimination with Pivoting is P-Complete
- scientific article; zbMATH DE number 4121437 (Why is no real title available?)
- Parallel Algorithms and Subcube Embedding on a Hypercube
- Concurrent Gaussian Elimination
- A geometric analysis of Gaussian elimination. I
- A collection of examples where Neville elimination outperforms Gaussian elimination
This page was built for publication: Gaussian elimination with pivoting on hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916304)