Effective partitioning method for computing weighted Moore-Penrose inverse

DOI10.1016/j.camwa.2007.07.014zbMath1152.65052arXiv1104.1690OpenAlexW2000362520MaRDI QIDQ2425450

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)

Full work available at URL: https://arxiv.org/abs/1104.1690

zbMATH Keywords

symbolic computationpolynomial matricessparse matricesweighted Moore-Penrose inverserational matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)

Related Items (12)

An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse ⋮ Representations and geometrical properties of generalized inverses over fields ⋮ Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization ⋮ An efficient matrix iteration for computing weighted Moore-Penrose inverse ⋮ Representations and symbolic computation of generalized inverses over fields ⋮ About the generalized \(LM\)-inverse and the weighted Moore-Penrose inverse ⋮ 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 ⋮ ComputingA_T,S(²) inverses of Hermitian matrices viaLDL^*decomposition for a square matrixA ⋮ Computation of generalized inverses using PHP/MySQL environment ⋮ Perfect control for right-invertible Grünwald-Letnikov plants - an innovative approach to practical implementation

Uses Software

• Mathematica

Cites Work

• Computation of the generalized inverse of a polynomial matrix and applications
• Inverses of multivariable polynomial matrices by discrete Fourier transforms
• 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
• Symbolic computation of weighted Moore-Penrose inverse using partitioning method
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Effective partitioning method for computing weighted Moore-Penrose inverse