Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
type: Item
instance of: scholarly article
title: Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
zbMATH Open document ID: 1251.65053
author: Alicja Smoktunowicz
author: Iwona Wróbel
published in: BIT
publication date: 2012-07-31T00:00:00Z
review text: The authors present a comparison of certain direct algorithms for computing the Moore-Penrose inverse, for matrices of full column rank, from the point of view of numerical stability. Their theoretical analysis is combined with reliable numerical experiments on Pascal and random matrices.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 15A09
Mathematics Subject Classification ID: 15B52
zbMATH DE Number: 6062475
zbMATH Keywords: Moore-Penrose inverse
zbMATH Keywords: numerical stability
zbMATH Keywords: condition number
zbMATH Keywords: singular value decomposition
zbMATH Keywords: algorithm
zbMATH Keywords: numerical experiments
zbMATH Keywords: random matrices
describes a project that uses: mctoolbox
describes a project that uses: mftoolbox
MaRDI profile type: Publication
full work available at URL: s10543-011-0362-0
OpenAlex ID: W1974717235
cites work: Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
cites work: Q4868585
cites work: A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
cites work: An Improved Algorithm for Computing the Singular Value Decomposition
cites work: Rang revealing QR factorizations
cites work: Q4348513
cites work: Rounding error analysis of the classical Gram-Schmidt orthogonalization process
cites work: Q5689624
cites work: QR factorization with complete pivoting and accurate computation of the SVD
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Functions of Matrices
cites work: Iterative algorithms for Gram-Schmidt orthogonalization
cites work: Fast computing of the Moore-Penrose inverse matrix
cites work: Numerical behaviour of Higham's scaled method for polar decomposition
cites work: Q4879581
cites work: Generalized matrix inversion is not harder than matrix multiplication
cites work: Numerical aspects of Gram-Schmidt orthogonalization of vectors
cites work: A note on the error analysis of classical Gram-Schmidt
cites work: Q5674306
DOI: 10.1007/S10543-011-0362-0
description: scientific article; zbMATH DE number 6062475