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

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

in recent years, there has been greater attempt to find numerical solutions of differential equations using wavelet's methods. the following method is based on vector forms of haar-wavelet functions. in this paper, we will introduce one dimensional haar-wavelet functions and the haar-wavelet operational matrices of the fractional order integration. also the haar-wavelet operational matrice...

This paper studies a class of real-rational matrix bilateral Diophantine equations (BDE) arising in numerous control problems. A necessary and sufficient solvability condition is derived in terms of state-space realizations of rational matrices involved in the equation. This condition is given in terms of a constrained matrix Sylvester equation and is numerically tractable. An explicit state-sp...

METT VII — 7th Workshop on Matrix Equations and Tensor Techniques Pisa, 13–14 Feb 2017 Program Monday, February 13 8:30 Registration Session I (chair: B. Meini) 9:00 Opening 9:15 P. Kürschner: Large generalized Sylvester equations with additional low-rank terms 9:40 G. Mele: Krylov methods for generalized Sylvester equations with low rank commutative coefficients 10:05 E. Ringh: Sylvester-based...

This paper addresses two problems: an image denoising problem assuming dense observations and an image reconstruction problem from sparse data. It shows that both problems can be solved by the Sylvester/Lyapunov algebraic equation. The Sylvester/Lyapunov equation has been extensively studied in Control Theory and it can be efficiently solved by well known numeric algorithms. This paper proposes...

a method for deformation computation based on strain tensor elements, as an alternative to the usual way of application of gradient of displacement vector, is proposed. the method computes directly the strain tensor elements from the computed/observed changes in distances and angles between the stations of a geodetic network in two epochs of observations. displacement vector which is determined...

An efficient computational method is presented for state space analysis of singular systems via Haar wavelets. Singular systems are those in which dynamics are governed by a combination of algebraic and differential equations. The corresponding differential-algebraic matrix equation is converted to a generalized Sylvester matrix equation by using Haar wavelet basis. First, an explicit expressio...

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

Let A be a unital complex semisimple Banach algebra, and MA denote its maximal ideal space. For matrix M∈An×n, Mˆ denotes the obtained by taking entry-wise Gelfand transforms. M∈Cn×n, σ(M)⊂C set of eigenvalues M. It is shown that if A∈An×n B∈Am×m are such for all φ∈MA, σ(Aˆ(φ))∩σ(Bˆ(φ))=∅, then C∈An×m, Sylvester equation AX−XB=C has unique solution X∈An×m. As an application, Roth's removal rule...