A generalization of the Moore-Penrose inverse related to matrix subspaces of \(\mathbb C^{n\times m}\)

DOI10.1016/j.amc.2010.01.062zbMath1187.15008OpenAlexW2123077849MaRDI QIDQ963935

B. E. Eshmatov

Publication date: 14 April 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.01.062

zbMATH Keywords

singular value decompositionFrobenius normconstrained least squares problemMoore-Penrose inverse\(S\)-Moore-Penrose inverseapproximate inverse preconditioningmatrix minimization problemminimum Frobenius norm solution

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Preconditioners for iterative methods (65F08)

Related Items

Geometrical and spectral properties of the orthogonal projections of the identity ⋮ Improving approximate inverses based on Frobenius norm minimization ⋮ A generalization of the optimal diagonal approximate inverse preconditioner

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Particular formulae for the Moore--Penrose inverse of a columnwise partitioned matrix
• Interval iterative methods for computing Moore-Penrose inverse
• A new method for computing Moore-Penrose inverse matrices
• A short proof of the Dennis-Schnabel theorem
• Using rank formulas to characterize equalities for Moore-Penrose inverses of matrix products.
• Generalized inverses. Theory and applications.
• The Moore-Penrose inverse of matrices with an acyclic bipartite graph
• On the Moore-Penrose generalized inverse matrix
• Matrix Analysis
• Iterative Solution Methods
• The Moore of the Moore-Penrose inverse
• Approximate inverse computation using Frobenius inner product
• Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning

This page was built for publication: A generalization of the Moore-Penrose inverse related to matrix subspaces of \(\mathbb C^{n\times m}\)