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.

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.

Inverse Dynamics of Delta Robot Based on the Principle of Virtual Work

A systematic methodology for solving the inverse dynamics of the Delta robot is presented.First,the inverse kinematics is solved based on the vector method.A new form of the Jacobi matrix formulized by the vectors is obtained so the three types kinematics singularities namely inverse, direct and combined types, can be identified with the physical meaning.Then based on the principle of virtual work, a methodology for driving the dynamical equations of motion is developed.Meanwhile the whole actuating torques, the torques caused by the gravity, the velocity and the acceleration are computed respectively in the numerical example. Results show that torque caused by the acceleration term is much bigger than the other two terms.This approach leads to efficient algorithms since the constraint forces and moments of the robot system have been eliminated from the equations of motion and there is no differential equation for the whole procedure when the principle of virtual work is applied to solving the inverse dynamical problem.

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.

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.

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.

Algorithms for Finding the Inverses of Factor Block Circulant Matrices

In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.

RESEARCHES ON INVERSE ORDER RULE FOR WEIGHTED GENERALIZED INVERSE

The weighted generalized inverses have several important applications in researching the singular matrices,regularization methods for ill-posed problems, optimization problems and statis- tics problems.In this paper we further research inverse order rules of weighted generalizde inverse. From the view point of munerical algebra, the different methods we used in inverse order rules pro- vide beneficial means for theory and computing of generalized inverse matrices.

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.

THE UNSOLVABILITY OF GENERALIZED INVERSE EIGENVALUE PROBLEMS ALMOST EVERYWHERE

In this paper the unsolvability of generalized inverse eigenvalue problems almost everywhere is discussed.We first give the definitions for the unsolvability of generalized inverse eigenvalue problems almost everywhere.Then adopting the method used in [14],we present some sufficient conditions such that the generalized inverse eigenvalue problems are unsohable almost everywhere.

Solution of an inverse problem for“fixed-fixed”and“fixed-free”spring-mass systems

The tridiagonal coefficient matrix for the ＂fixed-fixed＂ spring-mass system was obtained by changing spring length. And then a new algorithm of the inverse problem was designed to construct the masses and the spring constants from the natural frequencies of the ＂fixed-fixed＂ and ＂fixed-fres＂ spring-mass systems. An example was given to illustrate the results.

Some additive results on Drazin inverse

In this paper, we investigate additive results of the Drazin inverse of elements in a ring R. Under the condition ab = ha, we show that a ＋ b is Drazin invertible if and only if aaD （a ＋ b） is Drazin invertible, where the superscript D means the Drazin inverse. Furthermore we find an expression of （a ＋ b）D. As an application we give some new representations for the Drazin inverse of a 2 × 2 block matrix.

A NOTE ON THE DRAZIN INVERSE OF A MODIFIED MATRIX

In this article, the expression for the Drazin inverse of a modified matrix is considered and some interesting results are established. This contributes to certain recent results obtained by Y.Wei [9].

THE BI-SELF-CONJUGATE AND NONNEGATIVE DEFINITE SOLUTIONS TO THE INVERSE EIGENVALUE PROBLEM OF QUATERNION MATRICES

The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such that AX = X(?), where BSHn×n≥ denotes the set of all n×n quaternion matrices which are bi-self-conjugate and nonnegative definite. Problem Ⅱ2= Given B ∈ Hn×m, find B ∈ SE such that ||B-B||Q = minAE∈=sE ||B-A||Q, where SE is the solution set of problem I , || ·||Q is the quaternion matrix norm. The necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.

A NOTE ON THE REPRESENTATIONS FOR THE GENERALIZED DRAZIN INVERSE OF BLOCK MATRICES

We present some representations for the generalized Drazin inverse of a block matrix x =[cd ab]in a Banach algebra ~4 in terms of ad and （be）d under certain conditions,extending some recent result related to the generalized Drazin inverse of an anti-triangular operator matrix. Also, several particular cases of this result are considered.