Recursive computation of pseudo-inverse of matrices
نویسندگان
چکیده
منابع مشابه
A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...
متن کاملAbout the generalized LM-inverse and the weighted Moore-Penrose inverse
The recursive method for computing the generalized LM inverse of a constant rectangular matrix augmented by a column vector is proposed in [16, 17]. The corresponding algorithm for the sequential determination of the generalized LM -inverse is established in the present paper. We prove that the introduced algorithm for computing the generalized LM inverse and the algorithm for the computation o...
متن کاملThe algorithm for computing the Drazin inverses of two-variable polynomial matrices
We propose a finite algorithm for computing Drazin inverse of two-variable polynomial matrices based on Greville s finite algorithm for computing Drazin inverse of a constant matrix. Also a three-dimensional recursive algorithm to do that is deduced. Examples show that these methods are feasible and the implementation is developed in the symbolic package MATLAB. 2002 Elsevier Inc. All rights re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Automatica
دوره 18 شماره
صفحات -
تاریخ انتشار 1982