A note on the Moore-Penrose inverse of a companion matrix

Let R be an associative ring with unity 1. The existence of the Moore-Penrose inverses of block matrices overR is investigated and the sufficient ad necessary conditions for such existence are obtained. Furthermore, the representation of the Moore-Penrose inverse of M=[0 A C B]is given under the condition of EBF - 0, where E - I - CCT and F - I -AfA. This result generalizes the representation of the Moore-Penrose inverse of the companion matrix M =[0 a In b]due to Pedro Patricio. As for applications, some examples are given to illustrate the obtained results.

Computing the Moore-Penrose Inverse of a Matrix Through Symmetric Rank-One Updates

This paper presents a recursive procedure to compute the Moore-Penrose inverse of a matrix A. The method is based on the expression for the Moore-Penrose inverse of rank-one modified matrix. The computational complexity of the method is analyzed and a numerical example is included. A variant of the algorithm with lower computational complexity is also proposed. Both algorithms are tested on randomly generated matrices. Numerical performance confirms our theoretic results.

一类树的邻接矩阵的Moore-Penrose广义逆

根据矩阵结构性质,利用分块矩阵技巧给出任意点数、任意长直径的毛毛虫树邻接矩阵的Moore-Penrose广义逆的具体形式,为进一步研究毛毛虫树的代数性质提供理论支撑.

A NEW PERTURBATION THEOREM FOR MOORE-PENROSE METRIC GENERALIZED INVERSE OF BOUNDED LINEAR OPERATORS IN BANACH SPACES

In this paper, we investigate a new perturbation theorem for the Moore-Penrose metric generalized inverses of a bounded linear operator in Banach space. The main tool in this paper is ＂the generalized Neumann lemma＂ which is quite different from the method in [12] where ＂the generalized Banach lemma＂ was used. By the method of the perturba- tion analysis of bounded linear operators, we obtain an explicit perturbation theorem and three inequalities about error estimates for the Moore-Penrose metric generalized inverse of bounded linear operator under the generalized Neumann lemma and the concept of stable perturbations in Banach spaces.

The Reverse Order Law for Moore-Penrose Inverse of Closed Operators

In this paper, the reverse order law for the Moore-Penrose inverse of closed linear operators with closed range is investigated by virtue of the Norm-preserving extension of the bounded linear operators. The results generalize some results obtained by S Izumino in [12].

Moore-Penrose Inverses and Group Inverses of Block k-Circulant Matrices

The Moore-Penrose inverse of a block k-circulant matrix whose blocks are arbitrary matrices are obtained when k has unit modulus. In the meantime. explicit formulae for finding group inverses of certain specified k-circulant matrices are also given.

Unified Approach to the Expression for the Moore-Penrose Inverse of a- xy

Let A be an unital C*-algebra, a, x and y are elements in A. In this paper, we present a method how to calculate the Moore-Penrose inverse of a- xy*and investigate the expression for some new special cases of(a- xy*).

Perturbation Analysis for t-Product-Based Tensor Inverse,Moore-Penrose Inverse and Tensor System

This paper establishes some perturbation analysis for the tensor inverse,the tensor Moore-Penrose inverse,and the tensor system based on the t-product.In the settings of structured perturbations,we generalize the Sherman-Morrison-Woodbury(SMW)formula to the t-product tensor scenarios.The SMW formula can be used to perform the sensitivity analy-sis for a multilinear system of equations.

Moore-Penrose Inverse and Semilinear Equations

In this paper, we study the existence of solutions for the semilinear equation , where A is a , , and is a nonlinear continuous function. Assuming that the Moore-Penrose inverse AT(AAT)-1?exists (A denotes the transposed matrix of A) which is true whenever the determinant of the matrix AAT is different than zero, and the following condition on the nonlinear term satisfied . We prove that the semilinear equation has solutions for all. Moreover, these solutions can be found from the following fixed point relation .

PERTURBATION ANALYSIS OF A CLASS OF MATRIX INVERSE PROBLEMS

A class of matrix inverse problems minimizing ‖A-‖ F on the linear manifold l A=｛A∈R n×m ｜‖AX-B‖ F=min｝ is considered. The perturbation analysis of the solution to these problems is carried out. The perturbation upper bounds of the solution are given for both the consistent and inconsistent cases. The obtained preturbation upper bounds are with respect to the distance from the perturbed solution to the unperturbed manifold.

Diagonally loaded SMI algorithm based on inverse matrix recursion

The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.

Precise integration method without inverse matrix calculation for structural dynamic equations

The precise integration method proposed for linear time-invariant homogeneous dynamic systems can provide accurate numerical results that approach an exact solution at integration points. However, difficulties arise when the algorithm is used for non-homogeneous dynamic systems due to the inverse matrix calculation required. In this paper, the structural dynamic equalibrium equations are converted into a special form, the inverse matrix calculation is replaced by the Crout decomposition method to solve the dynamic equilibrium equations, and the precise integration method without the inverse matrix calculation is obtained. The new algorithm enhances the present precise integration method by improving both the computational accuracy and efficiency. Two numerical examples are given to demonstrate the validity and efficiency of the proposed algorithm.

一个2×2块矩阵的Moore-Penrose逆的显式公式

The representation for the Moore-Penrose inverse of the matrix[AC BD]is derived by using the solvability theory of linear equations,where A∈C^(m×n),B∈C^(m×p),C∈C^(q×n)and D∈C^(q×p),with which some special cases are discussed.

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method

A new method for solving the 1D Poisson equation is presented using the finite difference method. This method is based on the exact formulation of the inverse of the tridiagonal matrix associated with the Laplacian. This is the first time that the inverse of this remarkable matrix is determined directly and exactly. Thus, solving 1D Poisson equation becomes very accurate and extremely fast. This method is a very important tool for physics and engineering where the Poisson equation appears very often in the description of certain phenomena.

A New Algorithm for Computing the Determinant and the Inverse of a Pentadiagonal Toeplitz Matrix

An effective numerical algorithm for computing the determinant of a pentadiagonal Toeplitz matrix has been proposed by Xiao-Guang Lv and others [1]. The complexity of the algorithm is (9n + 3). In this paper, a new algorithm with the cost of (4n + 6) is presented to compute the determinant of a pentadiagonal Toeplitz matrix. The inverse of a pentadiagonal Toeplitz matrix is also considered.

6R Robot Inverse Solution Algorithm Based on Quaternion Matrix and Groebner Base

This article proposes a new algorithm of quaternion and dual quaternion in matrix form. It applies quaternion in special cases of rotated plane, transforming the sine and cosine of the rotation angle into matrix form, then exporting flat quaternions base in two matrix form. It establishes serial 6R manipulator kinematic equations in the form of quaternion matrix. Then five variables are eliminated through linear elimination and application of lexicographic Groebner base. Thus, upper bound of the degree of the equation is determined, which is 16. In this way, a 16-degree equation with single variable is obtained without any extraneous root. This is the first time that quaternion matrix modeling has been used in 6R robot inverse kinematics analysis.

Inverse Transformation of Elliptical Relative State Transition Matrix

A new set of relative orbit elements (ROEs) is used to derive a new elliptical formation flying model in previous work. In-plane and out-of-plane relative motions can be completely decoupled, which benefits elliptical formation design. In order to study the elliptical control strategy and perturbation effects, it is necessary to derive the inverse transformation of the relative state transition matrix based on relative orbit elements. Poisson bracket theory is used to obtain the linear transformations between the two representations: the relative orbit elements and the geocentric orbital frame. In this paper, the details of these transformations are presented.

A Novel Iterative Method to Find theMoore-Penrose Inverse of a Tensor with Einstein Product

In this study,based on an iterative method to solve nonlinear equations,a third-order convergent iterative method to compute the Moore-Penrose inverse of a tensor with the Einstein product is presented and analyzed.Numerical compar-isons of the proposed method with other methods show that the average number of iterations,number of the Einstein products,and CPU time of our method are considerably less than other methods.In some applications,partial and fractional differential equations that lead to sparse matrices are considered as prototypes.We use the iterates obtained by the method as a preconditioner,based on tensor form to solve the multilinear system A∗N X=B.Finally,several practical numerical examples are also given to display the accuracy and efficiency of the new method.The presented results show that the proposed method is very robust for obtaining the Moore-Penrose inverse of tensors.

THE NECESSARY AND SUFFICIENT CONDITIONS FOR THE SOLVABILITY OF A CLASS OF THE MATRIX INVERSE PROBLEM

Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. The best approximate solution by the above solution set is given. Thus the open problem in [1] is solved.

A MATRIX EQUATION FROM AN INVERSE PROBLEM OF VIBRATION THEORY

The symmetric,positive semidefinite,and positive definite real solutions of the matrix equation XA=YAD from an inverse problem of vibration theory are considered.When D=T the necessary and sufficient conditions for the existence of such solutions and their general forms are derived.