نتایج جستجو برای: coupled matrix equations

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

2013
Fatemeh Panjeh Ali Beik Davod Khojasteh Salkuyeh D. K. Salkuyeh

More recently, Beik and Salkuyeh [F. P. A. Beik and D. K. Salkuyeh, On the global Krylov subspace methods for solving general coupled matrix equations, Computers and Mathematics with Applications, 62 (2011) 4605–4613] have presented the Gl-FOM and Gl-GMRES algorithms for solving the general coupled linear matrix equations. In this paper, two new algorithms called weighted Gl-FOM (WGl-FOM) and w...

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

2012
Zeyad Al-Zhour

In Kronecker products works, matrices are some times regarded as vectors and vectors are some times made in to matrices. To be precise about these reshaping we use the vector and diagonal extraction operators. In the present paper, the results are organized in the following ways. First, we formulate the coupled matrix linear least-squares problem and present the efficient solutions of this prob...

In the present research, nonlinear vibration in a coupled system of Boron-Nitride nano-tube reinforced composite (BNNTRC) oil pipes is studied. Single-walled Boron-Nitride nano-tubes (SWBNNTs) are arranged in a longitudinal direction inside Poly-vinylidene fluoride (PVDF) matrix. Damping and shearing effects of surrounded medium are taken into account by visco-Pasternak model. Based on piezoele...

Journal: :Journal of Computational and Applied Mathematics 2007

Journal: :Int. J. Comput. Math. 2013
Fatemeh Panjeh Ali Beik Davod Khojasteh Salkuyeh

In this paper, we present an iterative algorithm for solving the following coupled Sylvester-transpose matrix equations q ∑ j=1 ( AijXjBij + CijX j Dij ) = Fi, i = 1, 2, . . . , p, over the generalized centro-symmetric matrix group (X1, X2, . . . , Xq). The solvability of the problem can be determined by the proposed algorithm, automatically. If the coupled Sylvester-transpose matrix equations ...

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

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