共查询到20条相似文献,搜索用时 15 毫秒
1.
Walter Gautschi 《Numerical Algorithms》2009,50(1):93-96
Inequalities for the largest zero of Jacobi polynomials, conjectured recently by us and in joint work with P. Leopardi, are here extended to all zeros of Jacobi polynomials, and new relevant conjectures are formulated based on extensive computation. 相似文献
2.
Inequalities are conjectured for the Jacobi polynomials and their largest zeros. Special attention is given to the cases β = α − 1 and β = α.
相似文献
3.
Abdullah Alt?n 《Journal of Mathematical Analysis and Applications》2009,353(1):121-1933
The main object of this paper is to construct a systematic investigation of a multivariable extension of the extended Jacobi polynomials and give some relations for these polynomials. We derive various families of multilinear and multilateral generating functions. We also obtain relations between the polynomials extended Jacobi polynomials and some other well-known polynomials. Other miscellaneous properties of these general families of multivariable polynomials are also discussed. Furthermore, some special cases of the results are presented in this study. 相似文献
4.
Walter Gautschi 《Numerical Algorithms》2008,49(1-4):195-198
P. Leopardi and the author recently investigated, among other things, the validity of the inequality $n\theta_n^{(\alpha,\beta)}\!<\! (n\!+\!1)\theta_{n+1}^{(\alpha,\beta)}$ between the largest zero $x_n\!=\!\cos\theta_n^{(\alpha,\beta)}$ and $x_{n+1}= \cos\theta_{n+1}^{(\alpha,\beta)}$ of the Jacobi polynomial $P_n^{(\alpha,\beta)}(x)$ resp. $P_{n+1}^{( \alpha,\beta)}(x)$ , α?>???1, β?>???1. The domain in the parameter space (α, β) in which the inequality holds for all n?≥?1, conjectured by us, is shown here to require a small adjustment—the deletion of a very narrow lens-shaped region in the square {???1?<?α?<???1/2, ???1/2?<?β?<?0}. 相似文献
5.
Rodica D. Costin 《Journal of Approximation Theory》2009,161(2):787-801
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a three term recurrence relation, integral inter-relations, and weak orthogonality relations. 相似文献
6.
Let be an orthonormal Jacobi polynomial of degree k. We will establish the following inequality:where δ-1<δ1 are appropriate approximations to the extreme zeros of . As a corollary we confirm, even in a stronger form, T. Erdélyi, A.P. Magnus and P. Nevai conjecture [T. Erdélyi, A.P. Magnus, P. Nevai, Generalized Jacobi weights, Christoffel functions, and Jacobi polynomials, SIAM J. Math. Anal. 25 (1994) 602–614] by proving thatin the region . 相似文献
7.
Walter Gautschi 《Numerical Algorithms》2009,52(3):409-418
Inequalities recently conjectured for all zeros of Jacobi polynomials of all degrees n are modified and conjectured to hold (in reverse direction) in considerably larger domains of the (α,β)-plane.
相似文献
8.
Bidyut Guha Thakurta 《Proceedings Mathematical Sciences》1986,95(1):53-59
In this paper, Weisner’s group-theoretic method of obtaining generating functions is utilized in the study of Jacobi polynomialsP> n (a,ß)(x) by giving suitable interpretations to the index (n) and the parameter (β) to find out the elements for constructing a six-dimensional Lie algebra. 相似文献
9.
The paper describes a method to compute a basis of mutually orthogonal polynomials with respect to an arbitrary Jacobi weight on the simplex. This construction takes place entirely in terms of the coefficients with respect to the so-called Bernstein–Bézier form of a polynomial. 相似文献
10.
We prove that Euler supercharacters for orthosymplectic Lie superalgebras can be obtained as a certain specialization of super Jacobi polynomials. A new version of Weyl type formula for super Schur functions and specialized super Jacobi polynomials play a key role in the proof. 相似文献
11.
《Discrete Mathematics》2023,346(6):113339
In this paper, we introduce the notion of Jacobi polynomials of a code with multiple reference vectors, and give the MacWilliams type identity for it. Moreover, we derive a formula to obtain the Jacobi polynomials using the Aronhold polarization operator. Finally, we describe some facts obtained from Type III and Type IV codes that interpret the relation between the Jacobi polynomials and designs. 相似文献
12.
Clemens Markett 《Indagationes Mathematicae》2019,30(1):81-93
For a long time it has been a challenging goal to identify all orthogonal polynomial systems that occur as eigenfunctions of a linear differential equation. One of the widest classes of such eigenfunctions known so far, is given by Koornwinder’s generalized Jacobi polynomials with four parameters and determining the orthogonality measure on the interval . The corresponding differential equation of order is presented here as a linear combination of four elementary components which make the corresponding differential operator widely accessible for applications. In particular, we show that this operator is symmetric with respect to the underlying scalar product and thus verify the orthogonality of the eigenfunctions. 相似文献
13.
14.
Paul C. Leopardi 《Numerical Algorithms》2007,45(1-4):75-87
In 2000, Reimer proved that a positive weight quadrature rule on the unit sphere has the property of quadrature regularity. Hesse and Sloan used a related property, called Property (R) in their work on
estimates of quadrature error on . The constants related to Property (R) for a sequence of positive weight quadrature rules on can be estimated by using a variation on Reimer’s bounds on the sum of the quadrature weight within a spherical cap, with
Jacobi polynomials of the form , in combination with the Sturm comparison theorem. A recent conjecture on monotonicities of Jacobi polynomials would, if
true, provide improved estimates for these constants.
The work was carried out while the author was a PhD student at the School of Mathematics, University of New South Wales. 相似文献
15.
A Oblomkov 《Advances in Mathematics》2004,186(1):153-180
We prove that the radial part of the Laplacian on the space of generalized spherical functions on the symmetric space GL(m+n)/GL(m)×GL(n) is the Sutherland differential operator for the root system BCn and the radial parts of the differential operators corresponding to the higher Casimirs yield the integrals of the quantum Calogero-Moser system. It allows us to give a representation theoretical construction for the three parameter family of Heckman-Opdam's Jacobi polynomials for the BCn root system. 相似文献
16.
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in the Bernoulli periodic functions. These are the periodic analogues of two works of Littmann [F. Littmann, Entire majorants via Euler–Maclaurin summation, Trans. Amer. Math. Soc. 358 (7) (2006) 2821–2836; F. Littmann, Entire approximations to the truncated powers, Constr. Approx. 22 (2) (2005) 273–295] that generalize a paper of Vaaler [J.D. Vaaler, Some extremal functions in Fourier analysis, Bull. Amer. Math. Soc. 12 (1985) 183–215]. As applications we provide the corresponding Erdös–Turán-type inequalities, approximations to other periodic functions and bounds for certain Hermitian forms. 相似文献
17.
We present a computer-assisted proof of positivity of sums over kernel polynomials for ultraspherical Jacobi polynomials. 相似文献
18.
In this paper, we treat three questions related to the d-orthogonality of the Humbert polynomials. The first one consists to determinate the explicit expression of the d-dimensional functional vector for which the d-orthogonality holds. The second one is the investigation of the components of Humbert polynomial sequence. That allows us to introduce, as far as we know, new d-orthogonal polynomials generalizing the classical Jacobi ones. The third one consists to solve a characterization problem related to a generalized hypergeometric representation of the Humbert polynomials. 相似文献
19.
It is well known that spectral methods (tau, Galerkin, collocation) have a condition number of ( is the number of retained modes of polynomial approximations). This paper presents some efficient spectral algorithms, which have a condition number of , based on the Jacobi–Galerkin methods of second-order elliptic equations in one and two space variables. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with specially structured matrices that can be efficiently inverted. The complexities of the algorithms are a small multiple of operations for a -dimensional domain with unknowns, while the convergence rates of the algorithms are exponentials with smooth solutions. 相似文献
20.
S. P. Yadav 《Acta Mathematica Hungarica》2003,98(1-2):21-30
Let X represent either the space C[-1,1] L
p
(α,β) (w), 1 ≦ p < ∞ on [-1, 1]. Then Xare Banach spaces under the sup or the p norms, respectively. We prove that there exists a normalized Banach subspace X
1
αβ of Xsuch that every f ∈ X
1
αβ can be represented by a linear combination of Jacobi polynomials to any degree of accuracy. Our method to prove such an approximation
problem is Fourier–Jacobi analysis based on the convergence of Fourier–Jacobi expansions.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献