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.











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)