Design of SPR systems with dynamic compensators and output variable structure control

This paper presents necessary and sufficient conditions for the following problem: given a linear time invariant plant G(s) = N(s)D(s)-1 = C(sI - A]-1B, with m inputs, p outputs, p > m, rank(C) = p, rank(B) = rank(CB) = m, £nd a tandem dynamic controller Gc(s) = D c(s)-1Nc(s) = Cc(sI - A c)-1Bc + Dc, with p inputs and m outputs and a constant output feedback matrix Ko ε ℝm×p such that the feedback system is Strictly Positive Real (SPR). It is shown that this problem has solution if and only if all transmission zeros of the plant have negative real parts. When there exists solution, the proposed method firstly obtains Gc(s) in order to all transmission zeros of Gc(s)G(s) present negative real parts and then Ko is found as the solution of some Linear Matrix Inequalities (LMIs). Then, taking into account this result, a new LMI based design for output Variable Structure Control (VSC) of uncertain dynamic plants is presented. The method can consider the following design specifications: matched disturbances or nonlinearities of the plant, output constraints, decay rate and matched and nonmatched plant uncertainties. © 2006 IEEE.

Kernel polynomials from L-orthogonal polynomials

A positive measure ψ defined on [a,b] such that its moments μn=∫a btndψ(t) exist for n=0,±1,±2,⋯, is called a strong positive measure on [a,b]. If 0≤aof (monic) polynomials {Qn}, defined by ∫a bt-n+sQn(t)dψ(t)=0, s=0,1,⋯,n-1, is known to exist. We refer to these polynomials as the L-orthogonal polynomials with respect to the strong positive measure ψ. The purpose of this manuscript is to consider some properties of the kernel polynomials associated with these L-orthogonal polynomials. As applications, we consider the quadrature rules associated with these kernel polynomials. Associated eigenvalue problems and numerical evaluation of the nodes and weights of such quadrature rules are also considered. © 2010 IMACS. Published by Elsevier B.V. All rights reserved.

On computational aspects of discrete Sobolev inner products on the unit circle

In this paper, we show how to compute in O(n2) steps the Fourier coefficients associated with the Gelfand-Levitan approach for discrete Sobolev orthogonal polynomials on the unit circle when the support of the discrete component involving derivatives is located outside the closed unit disk. As a consequence, we deduce the outer relative asymptotics of these polynomials in terms of those associated with the original orthogonality measure. Moreover, we show how to recover the discrete part of our Sobolev inner product. © 2013 Elsevier Inc. All rights reserved.

Posição e densidade dos zeros de Yang-Lee do modelo de Blume-Emery-Griffiths unidimensional sobre anéis conexos e desconexos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Polinômios ortogonais de Laurent na reta real e no círculo unitário

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise dos zeros da FTMA e ajuste de parâmetros de controladores suplementares de amortecimento acoplado ao dispositivo FACTS UPFC

Pós-graduação em Engenharia Elétrica - FEIS

Analogia entre propriedades de alguns polinômios ortogonais em uma e em várias variáveis

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

SPECTRUM OF STOCHASTIC ADDING MACHINES AND FIBERED JULIA SETS

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A Favard type theorem for orthogonal polynomials on the unit circle from a three term recurrence formula

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

RIEMANN ZETA ZEROS AND PRIME NUMBER SPECTRA IN QUANTUM FIELD THEORY

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Estabilidade de sistemas dinâmicos: Estudo do memristor

Pós-graduação em Matematica Aplicada e Computacional - FCT

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.

Schur-Szegö composition of entire functions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On the Milnor fibre and L numbers of semi-weighted homogeneous arrangements

Inthispaperwestudygermsofpolynomialsformedbytheproductofsemi-weighted homogeneous polynomials of the same type, which we call semi-weighted homogeneous arrangements. It is shown how the L numbers of such polynomials are computed using only their weights and degree of homogeneity. A key point of the main theorem is to find the number called polar ratio of this polynomial class. An important consequence is the description of the Euler characteristic of the Milnor fibre of such arrangements only depending on their weights and degree of homogeneity. The constancy of the L numbers in families formed by such arrangements is shown, with the deformed terms having weighted degree greater than the weighted degree of the initial germ. Moreover, using the results of Massey applied to families of function germs, we obtain the constancy of the homology of the Milnor fibre in this family of semi-weighted homogeneous arrangements.

The discriminants associated to isotropy representations of symmetric spaces

We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum number of squares required to represent the discrimininant is developed and applied in examples.