نتایج جستجو برای: matrix polynomial

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

2005
FRANK M. CALLIER FERDINAND KRAFFER

We review the polynomial matrix compensator equation XlDr + YlNr = Dk (COMP), e.g. (Callier and Desoer, 1982, Kučera, 1979; 1991), where (a) the right-coprime polynomial matrix pair (Nr,Dr) is given by the strictly proper rational plant right matrix-fraction P = NrD−1 r , (b) Dk is a given nonsingular stable closed-loop characteristic polynomial matrix, and (c) (Xl, Yl) is a polynomial matrix s...

Journal: :مهندسی برق و الکترونیک ایران 0
b. zaker m. karrari m. mirsalim g. b. gharehpetian n. moaddabi

this paper presents the application of the matching pursuit method to model synchronous generator. this method is useful for online analysis. in the proposed method, the field voltage is considered as input signal, while the terminal voltage and active power of the generator are output signals. usually, the difference equation with a second degree polynomial structure is used to estimate the co...

2016
M. S. Boudellioua E. Rogers

A direct method is developed that reduces a polynomial system matrix describing a discrete linear repetitive process to a 2-D singular state-space form such that all the relevant properties, including the zero structure of the system matrix, are retained. It is shown that the transformation linking the original polynomial system matrix with its associated 2-D singular form is zero coprime syste...

Journal: :Adv. in Math. of Comm. 2012
Fernando Hernando Tom Høholdt Diego Ruano

A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear codes and A is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Further...

Journal: :CoRR 2010
Ronan Quarez

We show that any symmetric positive definite homogeneous matrix polynomial M ∈ R[x1, . . . , xn] admits a piecewise semi-certificate, i.e. a collection of identites M(x) = P j fi,j(x)Ui,j(x) T Ui,j(x) where Ui,j(x) is a matrix polynomial and fi,j(x) is a non negative polynomial on a semialgebraic subset Si, where R = ∪ri=1Si. This result generalizes to the setting of biforms. Some examples of c...

Journal: :MCSS 2011
Stavros Vologiannidis Efstathios N. Antoniou

In [1] and [2] a new family of companion forms associated to a regular polynomial matrix T (s) has been presented, using products of permutations of n elementary matrices, generalizing similar results presented in [3] where the scalar case was considered. In this paper, extending this “permuted factors” approach, we present a broader family of companion like linearizations, using products of up...

Journal: :SIAM J. Matrix Analysis Applications 2015
Fernando de Terán Froilán M. Dopico Paul Van Dooren

We present necessary and sufficient conditions for the existence of a matrix polynomial when its degree, its finite and infinite elementary divisors, and its left and right minimal indices are prescribed. These conditions hold for arbitrary infinite fields and are determined mainly by the “index sum theorem”, which is a fundamental relationship between the rank, the degree, the sum of all parti...

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

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