Stability of Methods for Matrix Inversion

DOI10.1093/imanum/12.1.1zbMath0748.65021OpenAlexW2148551624WikidataQ56999017 ScholiaQ56999017MaRDI QIDQ3989253

Jeremy J. du Croz, Nicholas J. Higham

Publication date: 28 June 1992

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/12.1.1

zbMATH Keywords

algorithmerror boundsnumerical stabilityfactorizationblock methodstriangular matricesmatrix inversion methodsunblocked methods

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Exploiting higher computational efficiency index for computing outer generalized inverses, Optimal Design of Experiments for Implicit Models, Perturbation theory and backward error for \(AX - XB = C\), The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices, An integer approximation method for discrete sinusoidal transforms, Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms, On iterative algorithms for the polar decomposition of a matrix and the matrix sign function, An efficient computation of generalized inverse of a matrix, Factorizations of hyperpower family of iterative methods via least squares approach, Linear algebra software for large-scale accelerated multicore computing, Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures, Optimal exact designs of experiments via mixed integer nonlinear programming, Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\), Fast inversion of Vandermonde-like matrices involving orthogonal polynomials