Related papers: Moore-Penrose Inverse of some Linear Maps on Infin…
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…
In this paper, we investigate the perturbation for the Moore-Penrose inverse of closed operators on Hilbert spaces. By virtue of a new inner product defined on $H$, we give the expression of the Moore-Penrose inverse $\bar{T}^\dag$ and the…
Let $R$ be a ring with involution. The recently introduced notions of the core and dual core inverse are extended from matrix to an arbitrary $*$-ring case. It is shown that the group, Moore-Penrose, core and dual core inverse are closely…
In this paper, we provide a few properties of the weighted Moore--Penrose inverse for an arbitrary order tensor via the Einstein product. We again obtain some new sufficient conditions for the reverse-order law of the weighted…
In this article, specific definitions of the Moore-Penrose inverse, Drazin inverse of the quaternion tensor and the inverse along two quaternion tensors are introduced under the T-product. Some characterizations, representations and…
Since the day the core inverse has been known in a paper of Bakasarly and Trenkler, it has been widely researched. So far, there are four generalizations of this inverse for the case of matrices of an arbitrary index, namely, the BT…
This paper studies the issues about the generalized inverses of tensors under the C-Product. The aim of this paper is threefold. Firstly, this paper present the definition of the Moore-Penrose inverse, Drazin inverse of tensors under the…
The M-P (Moore-Penrose) pseudoinverse has as a key application the computation of least-squares solutions of inconsistent systems of linear equations. Irrespective of whether a given input matrix is sparse, its M-P pseudoinverse can be…
The Gauss-Seidel method has been used for more than 100 years as the standard method for the solution of linear systems of equations under certain restrictions. This method, as well as Cramer and Jacobi, is widely used in education and…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
In this paper, we give necessary and sufficient conditions for a real symmetric matrix, and in particular, for the distance matrix $D(H_n)$ of a helm graph $H_n$ to have their Moore-Penrose inverses as the sum of a symmetric Laplacian-like…
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…
Generalized inverses of tensors play increasingly important roles in computational mathematics and numerical analysis. It is appropriate to develop the theory of generalized inverses of tensors within the algebraic structure of a ring. In…
We develop quaternion--native iterative methods for computing the Moore--Penrose (MP) pseudoinverse of quaternion matrices and analyze their convergence. Our starting point is a damped Newton--Schulz (NS) iteration tailored to…
Recently, Malik and Ferreyra introduced the $m$-weak core inverse for complex square matrices which generalizes the core-EP inverse, the WC inverse, and therefore the core inverse. The main aim of this paper is to extend the concept of…
In this paper, we present some interesting results to characterize the Moore-Penrose inverses of unbounded closable operators and the Cartesian product of closed operators in Hilbert spaces.
Let $R$ be a unital ring with involution.In this paper, several new necessary and sufficient conditions for the existence of the Moore-Penrose inverse of an element in a ring $R$ are given.In addition, the formulae of the Moore-Penrose…
In this paper, new block representations of Moore-Penrose inverses for arbitrary complex $2\times2$ block matrices are given. The approach is based on block representations of orthogonal projection matrices.
We study matrix identities involving multiplication and unary operations such as transposition or Moore-Penrose inversion. We prove that in many cases such identities admit no finite basis.
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…