نتایج جستجو برای: s symmetric matrix
تعداد نتایج: 1112304 فیلتر نتایج به سال:
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
in this paper we introduce two symmetric variants of amenability, symmetric module amenability and symmetric connes amenability. we determine symmetric module amenability and symmetric connes amenability of some concrete banach algebras. indeed, it is shown that $ell^1(s)$ is a symmetric $ell^1(e)$-module amenable if and only if $s$ is amenable, where $s$ is an inverse semigroup with subsemigr...
in this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. also necessary and sufficient conditions for existenceof solution are given. some numerical examples illustrate the efficiencyof the method.
Given an undamped gyroscopic system GðλÞ 1⁄4 Mλ þ CλþK with M , K symmetric and C skew-symmetric, this paper presents a real-valued spectral decomposition of GðλÞ by a real standard pair ðX;TÞ and a skew-symmetric parameter matrix S . When T is assumed to be a block diagonal matrix, the parameter matrix S has a special structure. This spectral decomposition is applied to solve the quadratic inv...
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...
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...
SIAM J. Matrix Anal Appl. 26 (2005) 748–757 Abstract. Let R ∈ C and S ∈ C be nontrivial involutions; i.e., R = R 6= ±Im and S = S 6= ±In. We say that A ∈ C is (R,S)-symmetric ((R,S)-skew symmetric) if RAS = A (RAS = −A). We give an explicit representation of an arbitrary (R,S)-symmetric matrix A in terms of matrices P andQ associatedwith R and U and V associatedwith S. If R = R, then the least ...
In this paper we introduce two symmetric variants of amenability, symmetric module amenability and symmetric Connes amenability. We determine symmetric module amenability and symmetric Connes amenability of some concrete Banach algebras. Indeed, it is shown that $ell^1(S)$ is a symmetric $ell^1(E)$-module amenable if and only if $S$ is amenable, where $S$ is an inverse semigroup with subsemigr...
in this paper we study the impact of minkowski metric matrix on a projection in theminkowski space m along with their basic algebraic and geometric properties.the relationbetween the m-projections and the minkowski inverse of a matrix a in the minkowski spacemis derived. in the remaining portion commutativity of minkowski inverse in minkowski spacem is analyzed in terms of m-projections as an a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید