Zur Matrizeninversion nach Gauss-Jordan

Performing elementary row operations on [ A | I ] , we can calculate matrices whose columns form bases for N ( A ) and N ( A ) easily. These matrices are then used to construct a bordered matrix through which the Moore-Penrose inverse A of a general ...

In this paper, we design and evaluate a routine for the efficient generation of block-Jacobi preconditioners on graphics processing units (GPUs). Concretely, to exploit the architecture of the graphics accelerator, we develop a batched Gauss-Jordan ...

In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row ...