On weighted Lebesgue function type sums

Let I be a finite or infinite interval and dμ a measure on I. Assume that the weight function w(x)>0, w^′(x) exists, and the function w^′(x)/w(x) is non-increasing on I. Denote by ℓ_k's the fundamental polynomials of Lagrange interpolation on a set of nodes x₁<x₂<<x_n in I. The weighted Lebesgue function type sum for 1≤i<j≤n and s≥1 is defined by

In this paper the exact lower bounds of S_n(x) on a “big set” of I and are obtained. Some applications are also given.     

Markov-Type Inequalities for Products of Müntz Polynomials

Let Λ(λ_j)^∞_j=0 be a sequence of distinct real numbers. The span of {x^λ₀, x^λ₁, …, x^λ_n} over is denoted by M_n(Λ)span{x^λ₀, x^λ₁, …, x^λ_n}. Elements of M_n(Λ) are called Müntz polynomials. The principal result of this paper is the following Markov-type inequality for products of Müntz polynomials. T 2.1. LetΛ(λ_j)^∞_j=0andΓ(γ_j)^∞_j=0be increasing sequences of nonnegative real numbers. Let

Full-size image

Then

Full-size image

18(n+m+1)(λ_n+γ_m).In particular ,

Full-size image

Under some necessary extra assumptions, an analog of the above Markov-type inequality is extended to the cases when the factor x is dropped, and when the interval [0, 1] is replaced by [a, b](0, ∞).     

Permutation polynomials of the form

Recently, several classes of permutation polynomials of the form (x²+x+δ)^s+x over have been discovered. They are related to Kloosterman sums. In this paper, the permutation behavior of polynomials of the form (x^p−x+δ)^s+L(x) over is investigated, where L(x) is a linearized polynomial with coefficients in . Six classes of permutation polynomials on are derived. Three classes of permutation polynomials over are also presented.     

Representations for the first associated q-classical orthogonal polynomials

Let {p_k(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation D_q(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {p_k⁽¹⁾(x;q)} be associated polynomials of the polynomials {p_k(x; q)}. Explicit forms of the coefficients b_n,k and c_n,k in the expansions

are given in terms of basic hypergeometric functions. Here _k(x) equals x^k if σ⁺(0)=0, or (x;q)_k if σ⁺(1)=0, where σ⁺(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by p_n−1⁽¹⁾(x;q) in a special form, recurrence relations (in k) for b_n,k and c_n,k are obtained in terms of σ and τ.     

Bounds on Turán determinants

Let μ denote a symmetric probability measure on [−1,1] and let (p_n) be the corresponding orthogonal polynomials normalized such that p_n(1)=1. We prove that the normalized Turán determinant Δ_n(x)/(1−x²), where , is a Turán determinant of order n−1 for orthogonal polynomials with respect to . We use this to prove lower and upper bounds for the normalized Turán determinant in the interval −1<x<1.     

First and second kind paraorthogonal polynomials and their zeros

Given a probability measure μ with infinite support on the unit circle , we consider a sequence of paraorthogonal polynomials h_n(z,λ) vanishing at z=λ where is fixed. We prove that for any fixed z₀supp(dμ) distinct from λ, we can find an explicit ρ>0 independent of n such that either h_n or h_n+1 (or both) has no zero inside the disk B(z₀,ρ), with the possible exception of λ.Then we introduce paraorthogonal polynomials of the second kind, denoted s_n(z,λ). We prove three results concerning s_n and h_n. First, we prove that zeros of s_n and h_n interlace. Second, for z₀ an isolated point in supp(dμ), we find an explicit radius such that either s_n or s_n+1 (or both) have no zeros inside . Finally, we prove that for such z₀ we can find an explicit radius such that either h_n or h_n+1 (or both) has at most one zero inside the ball .     

Positive solutions for Robin problem involving the -Laplacian

Consider Robin problem involving the p(x)-Laplacian on a smooth bounded domain Ω as follows

Applying the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that there exists λ_*>0 such that the problem has at least two positive solutions if λ(0,λ_*), has at least one positive solution if λ=λ_*<+∞ and has no positive solution if λ>λ_*. To prove the results, we prove a norm on W^1,p(x)(Ω) without the part of ||_L^p(x)(Ω) which is equivalent to usual one and establish a special strong comparison principle for Robin problem.     

Q-operator and factorised separation chain for Jack polynomials

Applying Baxter's method of the Q-operator to the set of Sekiguchi's commuting partial differential operators we show that Jack polynomials P_λ^(1/g) (χ₁, …, χ_n) …, χ_n) are eigenfunctions of a one-parameter family of integral operators Q_z. The operators Q_z are expressed in terms of the Dirichlet-Liouville n-dimensional beta integral. From a composition of n operators Q_zk we construct an integral operator S_n factorising Jack polynomials into products of hypergeometric polynomials of one variable. The operator S_n admits a factorisation described in terms of restricted Jack polynomials P_λ^(1/g) (x₁, …, x_k, 1, … 1). Using the operator Q_z for z = 0 we give a simple derivation of a previously known integral representation for Jack polynomials.     

Inequalities of Rafalson type for algebraic polynomials

For a positive Borel measure dμ, we prove that the constantcan be represented by the zeros of orthogonal polynomials corresponding to dμ in case (i) dν(x)=(A+Bx)dμ(x), where A+Bx is nonnegative on the support of dμ and (ii) dν(x)=(A+Bx²)dμ(x), where dμ is symmetric and A+Bx² is nonnegative on the support of dμ. The extremal polynomials attaining the constant are obtained and some concrete examples are given including Markov-type inequality when dμ is a measure for Jacobi polynomials.     

Zeros of orthogonal polynomials on the real line

Let p_n(x) be the orthonormal polynomials associated to a measure dμ of compact support in . If Esupp(dμ), we show there is a δ>0 so that for all n, either p_n or p_n+1 has no zeros in (E−δ,E+δ). If E is an isolated point of supp(μ), we show there is a δ so that for all n, either p_n or p_n+1 has at most one zero in (E−δ,E+δ). We provide an example where the zeros of p_n are dense in a gap of supp(dμ).     

On numerical improvement of Gauss–Legendre quadrature rules

Among all integration rules with n points, it is well-known that n-point Gauss–Legendre quadrature rule∫₋₁¹f(x) dx∑_i=1ⁿw_if(x_i)has the highest possible precision degree and is analytically exact for polynomials of degree at most 2n−1, where nodes x_i are zeros of Legendre polynomial P_n(x), and w_i's are corresponding weights.In this paper we are going to estimate numerical values of nodes x_i and weights w_i so that the absolute error of introduced quadrature rule is less than a preassigned tolerance ε₀, say ε₀=10⁻⁸, for monomial functionsf(x)=x^j, j=0,1,…,2n+1.(Two monomials more than precision degree of Gauss–Legendre quadrature rules.) We also consider some conditions under which the new rules act, numerically, more accurate than the corresponding Gauss–Legendre rules. Some examples are given to show the numerical superiority of presented rules.     

Orthonormal polynomials with exponential-type weights

Let and let w_ρ(x)|x|^ρexp(-Q(x)), where and is an even function. In this paper we consider the properties of the orthonormal polynomials with respect to the weight , obtaining bounds on the orthonormal polynomials and spacing on their zeros. Moreover, we estimate A_n(x) and B_n(x) defined in Section 4, which are used in representing the derivative of the orthonormal polynomials with respect to the weight .     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part II: Clenshaw–Lord Type Approximants

Laurent–Padé (Chebyshev) rational approximants P _m (w,w ^–1)/Q _n (w,w ^–1) of Clenshaw–Lord type [2,1] are defined, such that the Laurent series of P _m /Q _n matches that of a given function f(w,w ^–1) up to terms of order w ^±(m+n), based only on knowledge of the Laurent series coefficients of f up to terms in w ^±(m+n). This contrasts with the Maehly-type approximants [4,5] defined and computed in part I of this paper [6], where the Laurent series of P _m matches that of Q _n f up to terms of order w ^±(m+n), but based on knowledge of the series coefficients of f up to terms in w ^±(m+2n). The Clenshaw–Lord method is here extended to be applicable to Chebyshev polynomials of the 1st, 2nd, 3rd and 4th kinds and corresponding rational approximants and Laurent series, and efficient systems of linear equations for the determination of the Padé–Chebyshev coefficients are obtained in each case. Using the Laurent approach of Gragg and Johnson [4], approximations are obtainable for all m0, n0. Numerical results are obtained for all four kinds of Chebyshev polynomials and Padé–Chebyshev approximants. Remarkably similar results of formidable accuracy are obtained by both Maehly-type and Clenshaw–Lord type methods, thus validating the use of either.     

Representation of Reproducing Kernels and the Lebesgue Constants on the Ball

For the weight function (1−x²)^μ−1/2 on the unit ball, a closed formula of the reproducing kernel is modified to include the case −1/2<μ<0. The new formula is used to study the orthogonal projection of the weighted L² space onto the space of polynomials of degree at most n, and it is proved that the uniform norm of the projection operator has the growth rate of n^(d−1)/2 for μ<0, which is the smallest possible growth rate among all projections, while the rate for μ0 is n^μ+(d−1)/2.     

On a Modification of the Jacobi Linear Functional: Asymptotic Properties and Zeros of the Corresponding Orthogonal Polynomials

The paper deals with orthogonal polynomials in the case where the orthogonality condition is related to semiclassical functionals. The polynomials that we discuss are a generalization of Jacobi polynomials and Jacobi-type polynomials. More precisely, we study some algebraic properties as well as the asymptotic behaviour of polynomials orthogonal with respect to the linear functional U U=J _,+A ₁(x–1)+B ₁(x+1)–A ₂(x–1)–B ₂(x+1), where J _, is the Jacobi linear functional, i.e. J _,,p›=_–1 ¹ p(x)(1–x)(1+x)dx,,>–1, pP, and P is the linear space of polynomials with complex coefficients. The asymptotic properties are analyzed in (–1,1) (inner asymptotics) and C[–1,1] (outer asymptotics) with respect to the behaviour of Jacobi polynomials. In a second step, we use the above results in order to obtain the location of zeros of such orthogonal polynomials. Notice that the linear functional U is a generalization of one studied by T. H. Koornwinder when A ₂=B ₂=0. From the point of view of rational approximation, the corresponding Markov function is a perturbation of the Jacobi–Markov function by a rational function with two double poles at ±1. The denominators of the [n–1/n] Padé approximants are our orthogonal polynomials.     

Galerkin solution of a singular integral equation with constant coefficients

Galerkin methods are used to approximate the singular integral equation

with solution φ having weak singularity at the endpoint −1, where a, b≠0 are constants. In this case φ is decomposed as φ(x)=(1−x)^α(1+x)^βu(x), where β=−α, 0<α<1. Jacobi polynomials are used in the discussions. Under the conditions fH^μ[−1,1] and k(t,x)H^μ,μ[−1,1]×[−1,1], 0<μ<1, the error estimate under a weighted L² norm is O(n^−μ). Under the strengthened conditions f^″H^μ[−1,1] and , 2α−<μ<1, the error estimate under maximum norm is proved to be O(n^2α−−μ+), where , >0 is a small enough constant.     

A simple and efficient kinetic spanner

We present a new and simple (1+ε)-spanner of size O(n/ε²) for a set of n points in the plane, which can be maintained efficiently as the points move. Assuming the trajectories of the points can be described by polynomials whose degrees are at most s, the number of topological changes to the spanner is O((n/ε²)λ_s+2(n)), and at each event the spanner can be updated in O(1) time.     

Positive periodic solutions of higher-dimensional functional difference equations with a parameter

By using Krasnoselskii's fixed point theorem and upper and lower solutions method, we find some sets of positive values λ determining that there exist positive T-periodic solutions to the higher-dimensional functional difference equations of the form where A(n)=diag[a₁(n),a₂(n),…,a_m(n)], h(n)=diag[h₁(n),h₂(n),…,h_m(n)], a_j,h_j :Z→R⁺, τ :Z→Z are T -periodic, j=1,2,…,m, T1, λ>0, x :Z→R^m, f :R₊^m→R₊^m, where R₊^m={(x₁,…,x_m)^TR^m, x_j0, j=1,2,…,m}, R⁺={xR, x>0}.     

On linearly related sequences of derivatives of orthogonal polynomials

We discuss an inverse problem in the theory of (standard) orthogonal polynomials involving two orthogonal polynomial families (P_n)_n and (Q_n)_n whose derivatives of higher orders m and k (resp.) are connected by a linear algebraic structure relation such as

for all n=0,1,2,…, where M and N are fixed nonnegative integer numbers, and r_i,n and s_i,n are given complex parameters satisfying some natural conditions. Let u and v be the moment regular functionals associated with (P_n)_n and (Q_n)_n (resp.). Assuming 0mk, we prove the existence of four polynomials Φ_M+m+i and Ψ_N+k+i, of degrees M+m+i and N+k+i (resp.), such that

the (k−m)th-derivative, as well as the left-product of a functional by a polynomial, being defined in the usual sense of the theory of distributions. If k=m, then u and v are connected by a rational modification. If k=m+1, then both u and v are semiclassical linear functionals, which are also connected by a rational modification. When k>m, the Stieltjes transform associated with u satisfies a non-homogeneous linear ordinary differential equation of order k−m with polynomial coefficients.     

Construction of polynomials that are orthogonal with respect to a discrete bilinear form

We describe a new algorithm for the computation of recursion coefficients of monic polynomials {p _j } _j ^=0/n that are orthogonal with respect to a discrete bilinear form (f, g) := _k ^=1/m f(x _k )g(x _k )w _k ,m n, with real distinct nodesx _k and real nonvanishing weightsw _k . The algorithm proceeds by applying a judiciously chosen sequence of real or complex Givens rotations to the diagonal matrix diag[x ₁,x ₂, ...,x _m ] in order to determine an orthogonally similar complex symmetric tridiagonal matrixT, from whose entries the recursion coefficients of the monic orthogonal polynomials can easily be computed. Fourier coefficients of given functions can conveniently be computed simultaneously with the recursion coefficients. Our scheme generalizes methods by Elhay et al. [6] based on Givens rotations for updating and downdating polynomials that are orthogonal with respect to a discrete inner product. Our scheme also extends an algorithm for the solution of an inverse eigenvalue problem for real symmetric tridiagonal matrices proposed by Rutishauser [20], Gragg and Harrod [17], and a method for generating orthogonal polynomials based theoron [18]. Computed examples that compare our algorithm with the Stieltjes procedure show the former to generally yield higher accuracy except whenn m. Ifn is sufficiently much smaller thanm, then both the Stieltjes procedure and our algorithm yield accurate results.Research supported in part by the Center for Research on Parallel Computation at Rice University and NSF Grant No. DMS-9002884.