Symbolic computation of weighted Moore-Penrose inverse using partitioning method
From MaRDI portal
Publication:2381358
DOI10.1016/j.amc.2006.11.114zbMath1125.65033arXiv1104.1696OpenAlexW1678867054MaRDI QIDQ2381358
Predrag S. Stanimirović, Marko D. Petković, Milan B. Tasić
Publication date: 17 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1696
Symbolic computation and algebraic computation (68W30) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (14)
Gröbner basis computation of Drazin inverses with multivariate rational function entries ⋮ Representations and geometrical properties of generalized inverses over fields ⋮ Effective partitioning method for computing weighted Moore-Penrose inverse ⋮ Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization ⋮ Symbolic and recursive computation of different types of generalized inverses ⋮ Representations of generalized inverses via full-rank QDR decomposition ⋮ Representations and symbolic computation of generalized inverses over fields ⋮ About the generalized \(LM\)-inverse and the weighted Moore-Penrose inverse ⋮ Discrete-time noise-tolerant Zhang neural network for dynamic matrix pseudoinversion ⋮ Effective partitioning method for computing generalized inverses and their gradients ⋮ Differentiation of generalized inverses for rational and polynomial matrices ⋮ Full-rank block \(LDL^\ast\) decomposition and the inverses of \(n\times n\) block matrices ⋮ On the \((p,q)\) outer generalized inverse in Banach algebra ⋮ ComputingAT,S(2) inverses of Hermitian matrices viaLDL*decomposition for a square matrixA
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of the generalized inverse of a polynomial matrix and applications
- Inverses of multivariable polynomial matrices by discrete Fourier transforms
- Report on test matrices for generalized inverses
- Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods
- Generalized inverses of two-variable polynomial matrices and applications
- An alternative proof of the Greville formula
- The computation and application of the generalized inverse via Maple
- DFT calculation of the generalized and Drazin inverse of a polynomial matrix
- A finite algorithm for generalized inverses of polynomial and rational matrices
- Dynamic programming and pseudo-inverses
- The algorithm for computing the Drazin inverses of two-variable polynomial matrices
- A finite algorithm for the Drazin inverse of a polynomial matrix
- Generalized inverses. Theory and applications.
- Partitioning method for rational and polynomial matrices
- Computing generalized inverse of polynomial matrices by interpolation
- The Souriau-Frame algorithm and the Drazin pseudoinverse
- On the computation of the generalized inverse of a polynomial matrix
- Computation of the inverse of a polynomial matrix and evaluation of its Laurent expansion
- Symbolic computation of the Moore–Penrose inverse using a partitioning method
- Leverrier’s Algorithm: A New Proof and Extensions
- Some Applications of the Pseudoinverse of a Matrix
- An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
This page was built for publication: Symbolic computation of weighted Moore-Penrose inverse using partitioning method