in this paper‎, ‎we study the extremal‎ ‎ranks and inertias of the hermitian matrix expression $$‎ ‎f(x,y)=c_{4}-b_{4}y-(b_{4}y)^{*}-a_{4}xa_{4}^{*},$$ where $c_{4}$ is‎ ‎hermitian‎, ‎$*$ denotes the conjugate transpose‎, ‎$x$ and $y$ satisfy‎ ‎the following consistent system of matrix equations $a_{3}y=c_{3}‎, ‎a_{1}x=c_{1},xb_{1}=d_{1},a_{2}xa_{2}^{*}=c_{2},x=x^{*}.$ as‎ ‎consequences‎, ‎we g...

in this paper, we find explicit solution to the operator equation$txs^* -sx^*t^*=a$ in the general setting of the adjointable operators between hilbert $c^*$-modules, when$t,s$ have closed ranges and $s$ is a self adjoint operator.

In this paper, the notion of Moore–Penrose biorthogonal systems is generalized. In [Fiedler, Moore–Penrose biorthogonal systems in Euclidean spaces, Lin. Alg. Appl. 362 (2003), pp. 137–143], transformations of generating systems of Euclidean spaces are examined in connection with the Moore-Penrose inverses of their Gram matrices. In this paper, g-inverses are used instead of the Moore–Penrose i...

In this paper, the notion of Moore–Penrose biorthogonal systems is generalized. In [Fiedler, Moore–Penrose biorthogonal systems in Euclidean spaces, Lin. Alg. Appl. 362 (2003), pp. 137–143], transformations of generating systems of Euclidean spaces are examined in connection with the Moore-Penrose inverses of their Gram matrices. In this paper, g-inverses are used instead of the Moore–Penrose i...

This paper reveals the relationship between the weighted Moore–Penrose generalized inverse and the force analysis of overconstrained parallel mechanisms (PMs), including redundantly actuated PMs and passive overconstrained PMs. The solution for the optimal distribution of the driving forces/torques of redundantly actuated PMs is derived in the form of a weighted Moore–Penrose inverse. Therefore...

We propose a method and algorithm for computing the weighted MoorePenrose 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 or computing the weighted Moore-Penrose inverse for constant matrices, originated in [2...

A matrix is free, or generic, if its nonzero entries are algebraically independent. Necessary and sufficient combinatorial conditions are presented for a complex free matrix to have a free Moore-Penrose inverse. These conditions extend previously known results for square, nonsingular free matrices. The result used to prove this characterization relates the combinatorial structure of a free matr...