Effective partitioning method for computing generalized inverses and their gradients

DOI10.1016/j.amc.2011.02.051zbMath1222.65038OpenAlexW2027491622MaRDI QIDQ544058

Predrag S. Stanimirović, Marko D. Petković, Milan B. Tasić

Publication date: 14 June 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.051

zbMATH Keywords

algorithmsymbolic computationpolynomial matricessparse matricesgeneralized inversesMoore-Penrose inversedifferentiationrational 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)

Uses Software

• Mathematica

Cites Work

• Symbolic and recursive computation of different types of generalized inverses
• Differentiation of generalized inverses for rational and polynomial matrices
• Report on test matrices for generalized inverses
• An alternative proof of the Greville formula
• Generalized inverses. Theory and applications.
• Partitioning method for rational and polynomial matrices
• A unified approach for the recursive determination of generalized inverses
• Symbolic computation of weighted Moore-Penrose inverse using partitioning method
• Effective partitioning method for computing weighted Moore-Penrose inverse
• Symbolic computation of the Moore–Penrose inverse using a partitioning method
• Response to Bucy’s comment on a paper by Udwadia and Kalaba
• Some Applications of the Pseudoinverse of a Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Effective partitioning method for computing generalized inverses and their gradients