ویراساینس.
سند علمی

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 auxiliary block matrix equations. Also, some numerical experiments for obtaining the numerical approximated solution of Sylvester matrix equations are given. Mathematics Subject Classification: 65F10

اسناد مشابه

  • on the numerical solution of generalized sylvester matrix equations

    مقاله۲۰۱۴bulletin of the iranian mathematical societyamer 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 a

  • On the Numerical Solution of Generalized Sylvester Matrix Equations

    سند علمی۲۰۱۴A. 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

  • On the numerical solution of generalized Sylvester matrix equations

    مقاله۲۰۱۴Bulletin of the Iranian Mathematical SocietyAmer 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

  • The polynomial solution to the Sylvester matrix equation

    سند علمی۲۰۰۶Appl. Math. Lett.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 equatio

  • On the solution of fuzzy Sylvester matrix equations without using Kronecker product and Vec-operation

    مقاله۲۰۲۶Caspian Journal of Mathematical SciencesMojtaba Ghanbari

    It is known that using Kronecker product and Vec-operation for solving matrix equations under fuzzy uncertainty, make the dimension of the crisp transformed systems much higher than the dimension of the initial fuzzy matrix equation. In this paper, a new iterative approach is pro

  • On the solution of parameterized Sylvester matrix equations

    مقاله۲۰۲۲Journal of Mathematical ModelingMarzieh Dehghani-Madiseh

    In this paper, parametric Sylvester matrix equations whose elements are linear functions of interval parameters are considered. In contrast to deterministic problems, when a system of equations is derived from a stochastic model, its coefficients may depend on some parameters and