An improved method for the computation of the Moore–Penrose inverse matrix

Applied Mathematics and Computation (Impact Factor: 1.6). 08/2011; DOI: 10.1016/j.amc.2011.04.080
Source: arXiv

ABSTRACT In this article we provide a fast computational method in order to calculate the Moore–
Penrose inverse of singular square matrices and of rectangular matrices. The proposed
method proves to be much faster and has significantly better accuracy than the already
proposed methods, while works for full and sparse matrices.

  • [Show abstract] [Hide abstract]
    ABSTRACT: The Moore-Penrose inverse has many applications in civil engineering, such as structural control, nonlinear buckling, and form-finding. However, solving the generalized inverse requires ample computational resources, especially for large-sized matrices. An efficient method based on group theory for the Moore-Penrose inverse problems for symmetric structures is proposed, which can deal with not only well-conditioned but also rank deficient matrices. First, the QR decomposition algorithm is chosen to evaluate the generalized inverse of any sparse and rank deficient matrix. In comparison with other well established algorithms, the QR method has superiority in computation efficiency and accuracy. Then, a group-theoretic approach to computing the Moore-Penrose inverse for problems involving symmetric structures is described. Based on the inherent symmetry and the irreducible representations, the orthogonal transformation matrices are deduced to express the inverse problem in a symmetry-adapted coordinate system. The original problem is transferred into computing the generalized inverse of many independent submatrices. Numerical experiments on three different types of structures with cyclic or dihedral symmetry are carried out. It is concluded from the numerical results and comparisons with two conventional methods that the proposed technique is efficient and accurate.
    Journal of Computing in Civil Engineering 03/2014; 28(2):182-190. DOI:10.1061/(ASCE)CP.1943-5487.0000266 · 1.39 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a general matrix iterative method of the type for computing an outer inverse , for given matrices and such that . Here is an arbitrary polynomial of degree . The convergence of the method is proven under certain necessary conditions and the characterization of all methods having order is given. The obtained results provide a direct generalization of all known iterative methods of the same type. Moreover, we introduce one new method and show a procedure how to improve the convergence order of existing methods. This procedure is demonstrated on one concrete method and the improvement is confirmed by numerical examples.
    Computers & Mathematics with Applications 06/2014; 67(10). DOI:10.1016/j.camwa.2014.03.019 · 2.00 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: An approximate dynamic programming (ADP) based supplementary learning control method is developed to online improve the performance of existing controllers. The proposed supplementary learning structure can make full use of the prior knowledge of the pre-designed controller and endow the controller with learning ability. Moreover, by introducing the action dependent value function for policy evaluation, the supplementary learning control can work in a model-free manner. The policy iteration algorithm is employed to train the actor-critic structure of the ADP supplementary controller. Simulation studies are carried out on the cart-pole system to validate the optimization and the adaptation capability of the proposed methodology.
    2014 26th Chinese Control And Decision Conference (CCDC); 05/2014

Full-text (2 Sources)

Available from
May 31, 2014