915 resultados para Orthogonal polynomials on the real line
Resumo:
"Reference literature": p. 136.
Resumo:
"September 1996"--Cover.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Appendixes: no. I. Copy of a letter from Col. Ambrose Norton [Nov. 1688]--no. II. Speech of Denzill Holmes, in 1660, to King Charles II.--no. III. Opinions of Mackintosh and Hallam upon the debates in The Convention parliament, 1689.--no. IV-V. Opinions of Mr. Fox, and of Locke.--no. VI. Of Lord Russell, and Algernon Sidney.--no. VII. The Oxford decree.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
2000 Mathematics Subject Classification: 26C05, 26C10, 30A12, 30D15, 42A05, 42C05.
Resumo:
MSC 2010: Primary: 447B37; Secondary: 47B38, 47A15
Resumo:
This paper presents an existence and localization result of unbounded solutions for a second-order differential equation on the half-line with functional boundary conditions. By applying unbounded upper and lower solutions, Green's functions and Schauder fixed point theorem, the existence of at least one solution is shown for the above problem. One example and one application to an Emden-Fowler equation are shown to illustrate our results.
Resumo:
This paper presents an existence and localization result of unbounded solutions for a second-order differential equation on the half-line with functional boundary conditions. By applying unbounded upper and lower solutions, Green's functions and Schauder fixed point theorem, the existence of at least one solution is shown for the above problem. One example and one application to an Emden-Fowler equation are shown to illustrate our results.
Resumo:
The class of hypergeometric polynomials F12(-m,b;b+b̄;1-z) with respect to the parameter b=λ+iη, where λ>0, are known to have all their zeros simple and exactly on the unit circle |z|=1. In this note we look at some of the associated extremal and orthogonal properties on the unit circle and on the interval (-1,1). We also give the associated Gaussian type quadrature formulas. © 2012 IMACS.
Resumo:
We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.
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)