Effective partitioning method for computing weighted Moore-Penrose inverse
From MaRDI portal
Publication:2425450
DOI10.1016/J.CAMWA.2007.07.014zbMATH Open1152.65052arXiv1104.1690OpenAlexW2000362520MaRDI QIDQ2425450FDOQ2425450
Predrag S. Stanimirović, Milan B. Tasić, Marko D. Petković
Publication date: 5 May 2008
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Abstract: We introduce a method and an algorithm for computing the weighted Moore-Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [M.B. Tasic, P.S. Stanimirovic, M.D. Petkovic, Symbolic computation of weighted Moore-Penrose inverse using partitioning method, Appl. Math. Comput. 189 (2007) 615-640] to multiple-variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Also, these methods are generalizations of the partitioning method for computing the Moore-Penrose inverse of rational and polynomial matrices introduced in [P.S. Stanimirovic, M.B. Tasic, Partitioning method for rational and polynomial matrices, Appl. Math. Comput. 155 (2004) 137-163; M.D. Petkovic, P.S. Stanimirovic, Symbolic computation of the Moore-Penrose inverse using partitioning method, Internat. J. Comput. Math. 82 (2005) 355-367] to the case of weighted Moore-Penrose inverse. Algorithms are implemented in the symbolic computational package MATHEMATICA.
Full work available at URL: https://arxiv.org/abs/1104.1690
Recommendations
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- Effective partitioning method for computing generalized inverses and their gradients
- Partitioning method for rational and polynomial matrices
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
- Partitioning method: computations and applications
sparse matricespolynomial matricessymbolic computationweighted Moore-Penrose inverserational matrices
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Symbolic computation and algebraic computation (68W30) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized inverses. Theory and applications.
- Title not available (Why is that?)
- The computation and application of the generalized inverse via Maple
- Partitioning method for rational and polynomial matrices
- Leverrier’s Algorithm: A New Proof and Extensions
- Generalized inverses of two-variable polynomial matrices and applications
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- 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
- Title not available (Why is that?)
- Some Applications of the Pseudoinverse of a Matrix
- Computation of the generalized inverse of a polynomial matrix and applications
- An alternative proof of the Greville formula
- DFT calculation of the generalized and Drazin inverse of a polynomial matrix
- On the computation of the generalized inverse of a polynomial matrix
- Inverses of multivariable polynomial matrices by discrete Fourier transforms
- Dynamic programming and pseudo-inverses
- A finite algorithm for generalized inverses of polynomial and rational matrices
- The algorithm for computing the Drazin inverses of two-variable polynomial matrices
- A finite algorithm for the Drazin inverse of a polynomial matrix
- Title not available (Why is that?)
- Computing generalized inverse of polynomial matrices by interpolation
- Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods
Cited In (14)
- Perfect control for right-invertible Grünwald-Letnikov plants - an innovative approach to practical implementation
- Title not available (Why is that?)
- Effective partitioning method for computing generalized inverses and their gradients
- Differentiation of generalized inverses for rational and polynomial matrices
- An interval extension of SMS method for computing weighted Moore-Penrose inverse
- Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization
- Representations and symbolic computation of generalized inverses over fields
- Computation of generalized inverses using PHP/MySQL environment
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- About the generalized \(LM\)-inverse and the weighted Moore-Penrose inverse
- ComputingAT,S(2) inverses of Hermitian matrices viaLDL*decomposition for a square matrixA
- An efficient matrix iteration for computing weighted Moore-Penrose inverse
- Representations and geometrical properties of generalized inverses over fields
Uses Software
This page was built for publication: Effective partitioning method for computing weighted Moore-Penrose inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425450)
