Computing Moore–Penrose Inverses with Polynomials in Matrices

DOI10.1080/00029890.2021.1886840zbMath1464.15005OpenAlexW3157547847MaRDI QIDQ4988270

Ignacio Bajo

Publication date: 12 May 2021

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2021.1886840

zbMATH Keywords

polynomialsMoore-Penrose inversecomplex matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Applications of generalized inverses (15A10)

Related Items (1)

A singular woodbury and pseudo-determinant matrix identities and application to Gaussian process regression

Cites Work

• Inertia characteristics of self-adjoint matrix polynomials
• The Moore-Penrose inverse of a factorization
• Generalized inverses. Theory and applications.
• Matrix Analysis
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Polygons, Circulant Matrices, and Moore-Penrose Inverses
• The Moore-Penrose Pseudoinverse of an Arbitrary, Square, k -circulant Matrix
• The Moore--Penrose Generalized Inverse for Sums of Matrices
• An Explicit Form of the Moore–Penrose Inverse of an Arbitrary Complex Matrix
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Moore–Penrose Inverses with Polynomials in Matrices