We introduce representations for {1, 2, 3}, {1, 2, 4}-inverses in terms of matrix products involving theMoore-Penrose inverse. We also use representations of {2, 3} and {2, 4}-inverses of a prescribed rank, introduced in [6] and [9]. These representations can be computed by means of the modification of the hyper-power iterative process which is used in computing matrix products involving the Moore-Penrose inverse, introduced in [8]. Introduced meth-ods have arbitrary high orders q ≥ 2. A few comparisons with the known modification of the hyper-power method from [17] are presented. 1
Abstract — In this article we present a new computational method for the Moore-Penrose inverse that ...
Abstract. In this paper, some new representations of the Moore-Penrose inverse of a complex m × n ma...
Performing elementary row operations on [ A | I ] , we can calculate matrices whose columns form bas...
An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical eq...
In this paper, novel representations of generalized inverses of rational matrices are developed. The...
Abstract. In this article a fast computational method is provided in order to calculate the Moore-Pe...
AbstractAn efficient algorithm, based on the LDL∗ factorization, for computing {1,2,3} and {1,2,4} i...
Abstract. The full-rank LDL ∗ decomposition of a polynomial Hermitian matrix is examined. Explicit f...
AbstractThis article gives the expressions for the Moore-Penrose inverses of m × n block matrices wh...
Conditions for the existence and representations of {2}-, {1}-, and {1, 2}-inverses which satisfy ce...
Computation of the generalised inverse A+ and rank of an arbitrary (including singular and rectangul...
AbstractBy using the ranks of matrices, this article gives necessary and sufficient conditions for t...
Hypermatrices are defined. Elementary operations and properties are defined and discussed. A 4-ary M...
Our goal is to investigate and exploit an analogy between the scaled hyperpower family (SHPI family)...
This thesis develops a general method for expressing ranks of matrix expressions that involve the Mo...
Abstract — In this article we present a new computational method for the Moore-Penrose inverse that ...
Abstract. In this paper, some new representations of the Moore-Penrose inverse of a complex m × n ma...
Performing elementary row operations on [ A | I ] , we can calculate matrices whose columns form bas...
An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical eq...
In this paper, novel representations of generalized inverses of rational matrices are developed. The...
Abstract. In this article a fast computational method is provided in order to calculate the Moore-Pe...
AbstractAn efficient algorithm, based on the LDL∗ factorization, for computing {1,2,3} and {1,2,4} i...
Abstract. The full-rank LDL ∗ decomposition of a polynomial Hermitian matrix is examined. Explicit f...
AbstractThis article gives the expressions for the Moore-Penrose inverses of m × n block matrices wh...
Conditions for the existence and representations of {2}-, {1}-, and {1, 2}-inverses which satisfy ce...
Computation of the generalised inverse A+ and rank of an arbitrary (including singular and rectangul...
AbstractBy using the ranks of matrices, this article gives necessary and sufficient conditions for t...
Hypermatrices are defined. Elementary operations and properties are defined and discussed. A 4-ary M...
Our goal is to investigate and exploit an analogy between the scaled hyperpower family (SHPI family)...
This thesis develops a general method for expressing ranks of matrix expressions that involve the Mo...
Abstract — In this article we present a new computational method for the Moore-Penrose inverse that ...
Abstract. In this paper, some new representations of the Moore-Penrose inverse of a complex m × n ma...
Performing elementary row operations on [ A | I ] , we can calculate matrices whose columns form bas...