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.
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.