نتایج جستجو برای: sylvester type matrix equation
تعداد نتایج: 1850700 فیلتر نتایج به سال:
All the conventional criterions to verify if a matrix is positive definite, Hurwitz or an M-matrix, such as Sylvester condition and Hurwitz theorem, require us to compute n determinants. This paper develops a new and simple criterion, based on a new type of Gaussian elimination process. In contrast to the traditional criterions, the new criterion only computes one determinate. Thus, the computi...
By using a Sylvester equation based parametrization, the minimum norm robust pole assignment problem for linear time-invariant systems is formulated as an unconstrained minimization problem for a suitably chosen cost function. The derived explicit expression of the gradient of the cost function allows the efficient solution of the minimization problem by using powerful gradient search based min...
The singularity problem of the solutions of some particular Sylvester equations is studied. As a consequence of this study, a good choice of a Sylvester equation which is associated to a linear continuous time system can be made such that its solution is nonsingular. This solution is then used to solve an eigenstructure assignment problem for this system. From a practical point view, this study...
Using the ranks and Moore-Penrose inverses of involved matrices, in this paper we establish some necessary sufficient solvability conditions for a system Sylvester-type quaternion matrix equations, give an expression general solution to when it is solvable. As application system, consider special symmetry solution, named η-Hermitian equations. Moreover, present algorithm numerical example verif...
We investigate the factored ADI iteration for large and sparse Sylvester equations. A novel low-rank expression for the associated Sylvester residual is established which enables cheap computations of the residual norm along the iteration, and which yields a reformulated factored ADI iteration. The application to generalized Sylvester equations is considered as well. We also discuss the efficie...
In this paper, We present the generalizations of the LSMR and NSCG methods for solving matrix equations. First, based on the LSMR algorithm, the Bl-LSMR and Gl-LSMR algorithms are derived by minimizing the Frobenius norm of residual matrix of normal equation. In addition, by extending the idea of LSMR algorithm, we also present the LSMR-M algorithm for solving the general coupled matrix equatio...
Reduced-order observer design has a long history spanning decades and involving various researchers in the control systems society. The first results on this problem were presented by Luenberger [1]. Thereafter, several papers have been presented examining the problems from different perspectives. One of these approaches is the Sylvester equation approach. This technique aeals mainly with the c...
Based on the well-known Leverrier algorithm, a simple explicit solution to right factofization of a linear system is established. This solution is expressed by the controllability matrix of the given system and a symmetric operator matrix. Applications of this solution to a type of generalized Sylvester matrix equations and the problem of parametric eigenstructure assignment by state feedback a...
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید