Parallel experience on the inverse matrix computation

From MaRDI portal





A technique for (full) matrix inversion that combines the bordering method (equivalently the Sherman-Morrison-Woodbury formula) with recursive partitioning is implemented on a Cray; CPU times are also reported but no comparison with other methods.











This page was built for publication: Parallel experience on the inverse matrix computation

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