global conjugate gradient method for solving large general sylvester matrix equation

اسناد مشابه

• Global conjugate gradient method for solving large general Sylvester matrix equation

  مقاله۲۰۱۳Journal of Mathematical ModelingSaeed Karimi

  In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A \in R^{n\times n}$ , $C \in R^{n\times n}$ , $B \in R^{s\times s}$ and $D \in R^{s\times s}$ are given matrices and $X \in R^{s\times s}$ is the unknown matr

• Gradient Iterative Method with Optimal Convergent Factor for Solving a Generalized Sylvester Matrix Equation with Applications to Diffusion Equations

  مقاله‌ی دسترسی آزاد۲۰۲۰SymmetryNunthakarnBoonruangkan, PattrawutChansangiam

• Algorithms for Solving Nonhomogeneous Generalized Sylvester Matrix Equations

  مقاله‌ی دسترسی آزاد۲۰۲۰Mathematical Problems in EngineeringEhab A.El-Sayed, Eid E.El Behady

• theoretical results on the global gmres method for solving generalized sylvester matrix‎ ‎equations

  مقاله۲۰۱۴bulletin of the iranian mathematical societyf. panjeh ali beik

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

• Theoretical results on the global GMRES method for solving generalized Sylvester matrix equations

  مقاله۲۰۱۴Bulletin of the Iranian Mathematical SocietyF. Panjeh Ali Beik

  The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation \[\sum\limits_{i = 1}^q {A_i } XB_i = C.\] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These resu

• On the Numerical Solution of Large Scale Sylvester Matrix Equations

  سند علمی۲۰۰۷Amer Kaabi, A. Kaabi

  This paper presents equivalent forms of the Sylvester matrix equations. These equivalent forms allow us to use block linear methods for solving large Sylvester matrix equations. In each step of theses iterative methods we use global FOM or global GMRES algorithm for solving an au