pith. sign in

arxiv: 1104.1696 · v1 · pith:XEHTX77Rnew · submitted 2011-04-09 · 💻 cs.SC · cs.DS· cs.MS· math.FA

Symbolic computation of weighted Moore-Penrose inverse using partitioning method

classification 💻 cs.SC cs.DScs.MSmath.FA
keywords inversemoore-penrosecomputingmethodweightedmatricesalgorithmpartitioning
0
0 comments X
read the original abstract

We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method for computing the weighted Moore-Penrose inverse for constant matrices, originated in Wang and Chen [G.R. Wang, Y.L. Chen, A recursive algorithm for computing the weighted Moore-Penrose inverse AMN, J. Comput. Math. 4 (1986) 74-85], and the partitioning method for computing the Moore-Penrose inverse of rational and polynomial matrices introduced in Stanimirovic and Tasic [P.S. Stanimirovic, M.B. Tasic, Partitioning method for rational and polynomial matrices, Appl. Math. Comput. 155 (2004) 137-163]. Algorithms are implemented in the symbolic computational package MATHEMATICA.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.