The Moore-Penrose Inverse of Intuitionistic Fuzzy Matrices
نویسندگان
چکیده
In this paper, we define the various g-inverses of an intuitionistic fuzzy matrices, left (right ) cancelable intuitionistic fuzzy matrices and derive the equivalent condition for the existence of the generalized inverses . We also study the relation between the minus-ordering and the various g–inverses of an intuitionistic fuzzy matrix.
منابع مشابه
The reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules
Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...
متن کاملAn Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملFast Computation of Moore-Penrose Inverse Matrices
Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors of synaptic weights, which contribute to the regularization of the input-output mapping. It is thus of interest to develop fast and accurate algorithms for ...
متن کاملEla Fast Computing of the Moore - Penrose Inverse Matrix
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.
متن کاملFast computing of the Moore-Penrose inverse matrix
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.
متن کامل