It often results in sublevel grey full rank square matrix to become non-feasible solution square matrix when there are null-strategy variables and redundancy constraints in the grey matrix solving method of grey matrix game. We can not directly find the optimum grey game solutions in the non-feasible solution square matrix. However, we define concepts of nullstrategy variables and redundancy co...

This chapter is about numerical methods for a particular type of equation expressed as a matrix equality. The Lyapunov equation is the most common problem in the class of problems called matrix equations. Other examples of matrix equations: Sylvester equation, Stein equation, Riccati equation. Definition 4.0.1. Consider two square matrices A, W ∈ Rn×n. The problem to find a square matrix X ∈ Rn...

This chapter is about numerical methods for a particular type of equation expressed as a matrix equality. The Lyapunov equation is the most common problem in the class of problems called matrix equations. Other examples of matrix equations: Sylvester equation, Stein equation, Riccati equation. Definition 5.0.1 Consider two square matrices A, W ∈ Rn×n. The problem to find a square matrix X ∈ Rn×...

We describe a polynomial-time algorithm for recognising the exterior square of a matrix. The approach involves manipulation of the equations which relate the entries of a matrix and the entries of its exterior square. Conditions are given which are necessary and sufficient for two matrices to have the same exterior square. The definition of the exterior square of a matrix, and the algorithm use...

‎The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation‎. ‎We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A‎, ‎X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$‎, ‎which $X$ is unknown matrix‎. ‎Also‎, ‎we suggest the new method for solving quadratic matri...

‎the global fom and gmres algorithms are among the effective‎ ‎methods to solve sylvester matrix equations‎. ‎in this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two cg-type algorithms for solving generalized sylvester matrix‎ ‎equations‎. ‎the proposed methods are iterative projection metho...

In this paper, we show that a matrix A in Mn(C) that has n coneigenvectors, where coneigenvaluesassociated with them are distinct, is condiagonalizable. And also show that if allconeigenvalues of conjugate-normal matrix A be real, then it is symmetric.  

A matrix has an ordinary inverse only if it is square, and even then only if it is nonsingular or, inother words, if its columns (or rows) are linearly independent. In recent years needs have been felt innumerous areas of applied mathematics for some kind of partial inverse of a matrix that is singularor even rectangular. In this paper, some results on the Quasi-commuting inverses, are given an...

in this paper, we propose the least-squares method for computing the positive solution of a m  n fully fuzzy linear system (ffls) of equations, where m > n, based on kaman&apos;s arithmetic operations on fuzzy numbers that introduced in [18]. first, we consider all elements of coecient matrix are non-negative or non-positive. also, we obtain 1-cut of the fuzzy number vector solution of the n...