نتایج جستجو برای: sylvester type matrix equation

تعداد نتایج: 1850700  

2007
P. T. Kabamba

This paper considers the solution to a class of the second-order Sylvester matrix equation EVF2 −AVF −CV = BW . Under the controllability of the matrix triple (E,A,B), a complete, general, and explicit parametric solution to the second-order Sylvester matrix equation, with the matrix F in a diagonal form, is proposed. The results provide great convenience to the analysis of the solution to the ...

2005
Robert Granat

This Licentiate Thesis contains contributions in two different subfields of Computing Science: parallel ScaLAPACK-style algorithms for Sylvester-type matrix equations and periodic eigenvalue reordering in a cyclic product of matrices. Sylvester-type matrix equations, like the continuous-time Sylvester equation AX −XB = C, where A of size m×m, B of size n×n and C of size m×n are general matrices...

‎The global generalized minimum residual (Gl-GMRES)‎ ‎method is examined for solving the generalized Sylvester matrix equation‎ ‎[sumlimits_{i = 1}^q {A_i } XB_i = C.]‎ ‎Some new theoretical results are elaborated for‎ ‎the proposed method by employing the Schur complement‎. ‎These results can be exploited to establish new convergence properties‎ ‎of the Gl-GMRES method for solving genera...

Journal: :journal of mathematical modeling 2013
saeed karimi

in this paper, an iterative method is proposed for solving large general sylvester matrix equation $axb+cxd = e$, where $a in r^{ntimes n}$ , $c in r^{ntimes n}$ , $b in r^{stimes s}$ and  $d in r^{stimes s}$ are given matrices and $x in r^{stimes s}$  is the unknown matrix. we present a global conjugate gradient (gl-cg) algo- rithm for solving linear system of equations with multiple right-han...

2014
Cennet Bolat Ahmet İpek

Some complex quaternionic equations in the type AX - XB = C are investigated. For convenience, these equations were called generalized Sylvester-quaternion equations, which include the Sylvester equation as special cases. By the real matrix representations of complex quaternions, the necessary and sufficient conditions for the solvability and the general expressions of the solutions are obtained.

2006
Robert A. Granat Isak Jonsson Bo Kågström

Recently, recursive blocked algorithms for solving triangular one-sided and two-sided Sylvester-type equations were introduced by Jonsson and K̊agström. This elegant yet simple technique enables an automatic variable blocking that has the potential of matching the memory hierarchies of today’s HPC systems. The main parts of the computations are performed as level 3 general matrix multiply and ad...

Journal: :bulletin of the iranian mathematical society 2014
amer kaabi

‎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...

2015
M. E. Charkani

where X ∈ M(n,m)(K), play a central role in many areas of applied mathematics and in particular in systems and control theory. It is well known that if K is an algebraically closed field then the matrix equation (1) possesses a unique solution if and only if the matrices A and B have no common eigenvalues (see [[3]] and [11]). In this work we give a brief survey of methods used to solve the (SM...

Journal: :Appl. Math. Lett. 2006
Qingxi Hu Daizhan Cheng

For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-uniqueness, the solution set of the Sylvester matrix equation is a subset of that of a deduced equation, which is a system of linear algebraic equations. c © 2005 Elsevier Ltd. All rights reserved.

2014
Froilán M. Dopico Javier González Daniel Kressner Valeria Simoncini

The matrix Sylvester equation for congruence, or T-Sylvester equation, has recently attracted considerable attention as a consequence of its close relation to palindromic eigenvalue problems. The theory concerning T-Sylvester equations is rather well understood and there are stable and efficient numerical algorithms which solve these equations for smallto medium-sized matrices. However, develop...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید