Representations of generalized inverses via full-rank QDR decomposition
From MaRDI portal
Publication:2225531
DOI10.1007/s11075-020-00935-4zbMath1457.15006OpenAlexW3023472202MaRDI QIDQ2225531
Nahier Aldhafeeri, Milan B. Tasić, Dimitrios Pappas, Ivan P. Stanimirović
Publication date: 8 February 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00935-4
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Related Items
Cites Work
- Computation of generalized inverses by using the \(LDL^{\ast}\) decomposition
- Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization
- Generalized inverses of two-variable polynomial matrices and applications
- The algorithm for computing the Drazin inverses of two-variable polynomial matrices
- Generalized inverses: theory and computations
- Generalized inverses. Theory and applications.
- On the Moore-Penrose generalized inverse matrix
- Two finite-time convergent Zhang neural network models for time-varying complex matrix Drazin inverse
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- Computing generalized inverses using LU factorization of matrix product
- Numerical and Symbolic Computations of Generalized Inverses
- Symbolic computation of the Moore–Penrose inverse using a partitioning method
- Mixed and componentwise condition numbers for matrix decompositions
