952 resultados para Orthogonal polynomials on the unit circle
Resumo:
The advantages of wireless sensing implemented on the cold chain of fresh products are well known. These sensor systems consist of a combination of delicate internal electronic circuitry enclosed in a special housing unit. Manufacturers however are presented with the challenge that the housing required to withstand the harsh environment in which the sensors are being used all too often take from the functionality of the sensor. Therefore the target of this study is to determine the dynamic behavior and the counteractive effects of the sensor housing on temperature recording accuracy in the wireless nodes of Wireless Sensor Network (WSN) and Radio Frequency Identification (RFID) semi-passive tags. Two kind of semi-passive Turbo Tags were used (T700 and T702-B), which consisted of sensors with and without a cover, and two kind of WSN nodes, IRIS (sensors Intersema and Sensirion soldered in the motherboard) and NLAZA (Sensirion in a cable and soldered to the motherboard). To recreate the temperature profiles the devices were rotated between a cold room(5 ºC) through a ambient room(23 ºC) to a heated environment (35ºC) and vice versa. Analysis revealed the differences between housing and no housing are 308.22s to 21.99s respectively in the step from 5 to 35 ºC. As is demonstrated in these experiments the influence of the housing significantly hinders sensor accuracy.
Resumo:
In this paper we give the first investigations and also some basic results on the unit groups of commutative group algebras in Bulgaria. These investigations continue some classical results. Namely, it is supposed that the cardinality of the starting group is arbitrary.
Resumo:
MSC 2010: 33C47, 42C05, 41A55, 65D30, 65D32
Resumo:
In this work, we have mainly achieved the following: 1. we provide a review of the main methods used for the computation of the connection and linearization coefficients between orthogonal polynomials of a continuous variable, moreover using a new approach, the duplication problem of these polynomial families is solved; 2. we review the main methods used for the computation of the connection and linearization coefficients of orthogonal polynomials of a discrete variable, we solve the duplication and linearization problem of all orthogonal polynomials of a discrete variable; 3. we propose a method to generate the connection, linearization and duplication coefficients for q-orthogonal polynomials; 4. we propose a unified method to obtain these coefficients in a generic way for orthogonal polynomials on quadratic and q-quadratic lattices. Our algorithmic approach to compute linearization, connection and duplication coefficients is based on the one used by Koepf and Schmersau and on the NaViMa algorithm. Our main technique is to use explicit formulas for structural identities of classical orthogonal polynomial systems. We find our results by an application of computer algebra. The major algorithmic tools for our development are Zeilberger’s algorithm, q-Zeilberger’s algorithm, the Petkovšek-van-Hoeij algorithm, the q-Petkovšek-van-Hoeij algorithm, and Algorithm 2.2, p. 20 of Koepf's book "Hypergeometric Summation" and it q-analogue.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
We carry out a numerical and analytic analysis of the Yang-Lee zeros of the ID Blume-Capel model with periodic boundary conditions and its generalization on Feynman diagrams for which we include sums over all connected and nonconnected rings for a given number of spins. In both cases, for a specific range of the parameters, the zeros originally on the unit circle are shown to depart from it as we increase the temperature beyond some limit. The curve of zeros can bifurcate- and become two disjoint arcs as in the 2D case. We also show that in the thermodynamic limit the zeros of both Blume-Capel models on the static (connected ring) and on the dynamical (Feynman diagrams) lattice tend to overlap. In the special case of the 1D Ising model on Feynman diagrams we can prove for arbitrary number of spins that the Yang-Lee zeros must be on the unit circle. The proof is based on a property of the zeros of Legendre polynomials.
Resumo:
Soit $\displaystyle P(z):=\sum_{\nu=0}^na_\nu z^{\nu}$ un polynôme de degré $n$ et $\displaystyle M:=\sup_{|z|=1}|P(z)|.$ Sans aucne restriction suplémentaire, on sait que $|P'(z)|\leq Mn$ pour $|z|\leq 1$ (inégalité de Bernstein). Si nous supposons maintenant que les zéros du polynôme $P$ sont à l'extérieur du cercle $|z|=k,$ quelle amélioration peut-on apporter à l'inégalité de Bernstein? Il est déjà connu [{\bf \ref{Mal1}}] que dans le cas où $k\geq 1$ on a $$(*) \qquad |P'(z)|\leq \frac{n}{1+k}M \qquad (|z|\leq 1),$$ qu'en est-il pour le cas où $k < 1$? Quelle est l'inégalité analogue à $(*)$ pour une fonction entière de type exponentiel $\tau ?$ D'autre part, si on suppose que $P$ a tous ses zéros dans $|z|\geq k \, \, (k\geq 1),$ quelle est l'estimation de $|P'(z)|$ sur le cercle unité, en terme des quatre premiers termes de son développement en série entière autour de l'origine. Cette thèse constitue une contribution à la théorie analytique des polynômes à la lumière de ces questions.
Resumo:
In the analysis of stability of a variant of the Crank-Nicolson (C-N) method for the heat equation on a staggered grid a class of non-symmetric matrices appear that have an interesting property: their eigenvalues are all real and lie within the unit circle. In this note we shall show how this class of matrices is derived from the C-N method and prove that their eigenvalues are inside [-1, 1] for all values of m (the order of the matrix) and all values of a positive parameter a, the stability parameter sigma. As the order of the matrix is general, and the parameter sigma lies on the positive real line this class of matrices turns out to be quite general and could be of interest as a test set for eigenvalue solvers, especially as examples of very large matrices. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
We discuss an old theorem of Obrechkoff and some of its applications. Some curious historical facts around this theorem are presented. We make an attempt to look at some known results on connection coefficients, zeros and Wronskians of orthogonal polynomials from the perspective of Obrechkoff's theorem. Necessary conditions for the positivity of the connection coefficients of two families of orthogonal polynomials are provided. Inequalities between the kth zero of an orthogonal polynomial p(n)(x) and the largest (smallest) zero of another orthogonal polynomial q(n)(x) are given in terms of the signs of the connection coefficients of the families {p(n)(x)} and {q(n)(x)}, An inequality between the largest zeros of the Jacobi polynomials P-n((a,b)) (x) and P-n((alpha,beta)) (x) is also established. (C) 2001 Elsevier B.V. B.V. All rights reserved.
Resumo:
Relation between two sequences of orthogonal polynomials, where the associated measures are related to each other by a first degree polynomial multiplication (or division), is well known. We use this relation to study the monotonicity properties of the zeros of generalized orthogonal polynomials. As examples, the Jacobi, Laguerre and Charlier polynomials are considered. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
We consider a connection that exists between orthogonal polynomials associated with positive measures on the real line and orthogonal Laurent polynomials associated with strong measures of the class S-3 [0, beta, b]. Examples are given to illustrate the main contribution in this paper. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)