Some extremal properties of the integral of legendre polynomials

1. Introduction and Main ResultsDenote by Pn the set of algebraic polynomials of degree not exceeding n. LetX = {X = (xl,xz,...,x.). 1 = xl > xz >' > xtL--l > xtL = --l}, n 2 2and let for X E X.Erd6s in [21 raised the question of determining Y E X such thatReceived July 21, 1999.also conjectured that Y = Z satisfyingw,,(Z, x) = c1' l" Pt.--1 (x) dx,j-- 1 Pt.-- 1 (x) dx,1 .2>where P,--1 stands for the (n -- 1)th Legendre polynomial normalized by Pn--1 (1) = l. Thiscolljecture was di…     

THE KRALL POLYNOMIALS: A NEW CLASS OF ORTHOGONAL POLYNOMIALS

Abstract

A new set of orthogonal polynomials is found that are solutions to a sixth order formally self adjoint differential equation. These polynomials are shown to generalize the Legendre and Legendre type polynomials. We also show that these polynomials satisfy many properties shared by the classical orthogonal polynomials of Jacobi, Laguerre and Hermite.     

Legendre polynomial solutions of high-order linear Fredholm integro-differential equations

In this study, a Legendre collocation matrix method is presented to solve high-order Linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials. The proposed method converts the equation and conditions to matrix equations, by means of collocation points on the interval [−1, 1], which corresponding to systems of linear algebraic equations with Legendre coefficients. Thus, by solving the matrix equation, Legendre coefficients and polynomial approach are obtained. Also examples that illustrate the pertinent features of the method are presented and by using the error analysis, the results are discussed.     

Solving high‐order linear differential equations by a Legendre matrix method based on hybrid Legendre and Taylor polynomials

A numerical method for solving the high‐order linear differential equations with variable coefficients under the mixed conditions is presented. The method is based on the hybrid Legendre and Taylor polynomials. The solution is obtained in terms of Legendre polynomials. Comparison of the present solution is made with the existing solution and excellent agreement is noted. Illustrative examples are included to demonstrate the validity and applicability of the technique. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Existence Conditions for Extremal Probability Measures on Polish Spaces and Some of Their Properties

Mathematical Notes - In this paper, the properties of the primitives of Legendre polynomials on the interval $$[0;1]$$ are studied. It is proved that the Legendre polynomials form an...     

Singular quadratic variational problems

The purpose of this paper is to show that the general theory of quadratic forms developed earlier by the author is applicable to singular variational problems as well as to nonsingular ones. In particular, this general theory is applicable to the singular variational problems associated with Legendre polynomials, associated Legendre polynomials, Jacobi polynomials, and Tchebysheff polynomials.     

Matrix-valued polynomials generated by the scalar-type Rodrigues’ formulas

The properties of matrix-valued polynomials generated by the scalar-type Rodrigues’ formulas are analyzed. A general representation of these polynomials is found in terms of products of simple differential operators. The recurrence relations, leading coefficients, completeness are established, as well as, in the commutative case, the second order equations for which these polynomials are eigenfunctions and the corresponding eigenvalues, and ladder operators.A new, direct proof is given to the conjecture of Durán and Grünbaum that if the weights are self-adjoint and positive semidefinite then they are necessarily of scalar type.Commutative classes of orthogonal polynomials (corresponding to weights that are self-adjoint but not positive semidefinite) are found, which satisfy all the properties usually associated to orthogonal polynomials, and are not of scalar type.     

Turán type inequalities for generalized complete elliptic integrals

In this paper our aim is to establish some Turán type inequalities for Gaussian hypergeometric functions and for generalized complete elliptic integrals. These results complete the earlier result of P. Turán proved for Legendre polynomials. Moreover we show that there is a close connection between a Turán type inequality and a sharp lower bound for the generalized complete elliptic integral of the first kind. At the end of this paper we prove a recent conjecture of T. Sugawa and M. Vuorinen related to estimates of the hyperbolic distance of the twice punctured plane. Dedicated to my son Koppány.     

关于勒让德多项式与契贝谢夫多项式间的关系

主要研究勒让德多项式与契贝谢夫多项式之间的关系的性质,利用生成函数和函数级数展开的方法,得出了勒让德多项式与契贝谢夫多项式之间的一个重要关系,这对勒让德多项式与契贝谢夫多项式的研究有一定的推动作用．     

Parabolic Kazhdan–Lusztig polynomials for quasi-minuscule quotients

We study the parabolic Kazhdan–Lusztig polynomials for the quasi-minuscule quotients of Weyl groups. We give explicit closed combinatorial formulas for the parabolic Kazhdan–Lusztig polynomials of type q. Our study implies that these are always either zero or a monic power of q, and that they are not combinatorial invariants. We conjecture a combinatorial interpretation for the parabolic Kazhdan–Lusztig polynomials of type −1.     

A quadrature tau method for fractional differential equations with variable coefficients

In this article, we develop a direct solution technique for solving multi-order fractional differential equations (FDEs) with variable coefficients using a quadrature shifted Legendre tau (Q-SLT) method. The spatial approximation is based on shifted Legendre polynomials. A new formula expressing explicitly any fractional-order derivatives of shifted Legendre polynomials of any degree in terms of shifted Legendre polynomials themselves is proved. Extension of the tau method for FDEs with variable coefficients is treated using the shifted Legendre–Gauss–Lobatto quadrature. Numerical results are given to confirm the reliability of the proposed method for some FDEs with variable coefficients.     

A New Approach for Solving a Class of Delay Fractional Partial Differential Equations

In this article, a new numerical approach has been proposed for solving a class of delay time-fractional partial differential equations. The approximate solutions of these equations are considered as linear combinations of Müntz–Legendre polynomials with unknown coefficients. Operational matrix of fractional differentiation is provided to accelerate computations of the proposed method. Using Padé approximation and two-sided Laplace transformations, the mentioned delay fractional partial differential equations will be transformed to a sequence of fractional partial differential equations without delay. The localization process is based on the space-time collocation in some appropriate points to reduce the fractional partial differential equations into the associated system of algebraic equations which can be solved by some robust iterative solvers. Some numerical examples are also given to confirm the accuracy of the presented numerical scheme. Our results approved decisive preference of the Müntz–Legendre polynomials with respect to the Legendre polynomials.     

Strong factorization property of Macdonald polynomials and higher-order Macdonald’s positivity conjecture

We prove a strong factorization property of interpolation Macdonald polynomials when q tends to 1. As a consequence, we show that Macdonald polynomials have a strong factorization property when q tends to 1, which was posed as an open question in our previous paper with Féray. Furthermore, we introduce multivariate q, t-Kostka numbers and we show that they are polynomials in q, t with integer coefficients by using the strong factorization property of Macdonald polynomials. We conjecture that multivariate q, t-Kostka numbers are in fact polynomials in q, t with nonnegative integer coefficients, which generalizes the celebrated Macdonald’s positivity conjecture.     

Asymptotics for zeros of Szeg polynomials associated with trigonometric polynomial signals

The study of Wiener-Levinson digital filters leads to certain classes of polynomials orthogonal on the unit circle (Szeg polynomials). Here we present theorems that show that the unknown frequencies in a periodic discrete time signal can be determined from the limiting behavior (as N → ∞) of the zeros of fixed degree Szeg polynomials that are orthogonal with respect to a distribution defined from N successive samples of the signal. This proves an essential part of a conjecture due to Jones, Njåstad, and Saff concerning the frequency analysis problem.     

The Lebesgue constants of the biorthonormal system {Pn,Qn} and “Jackson” type theorem for a kind of new approximation problem

In this paper first we discuss the Lebesgue constants of the biorthonormal system {P_n,Q_n} on an ellipse, where P_n, Q_n are the Legendre polynomials and the second kind Legendre functions respectively. Secondly, for a kind of new approximation problem we give a corresponding “Jackson” type theorem of continuous functions on an ellipse.     

Adomian decomposition method with orthogonal polynomials: Legendre polynomials

This paper illustrates the using of orthogonal polynomials to modify the Adomian decomposition method. The method of employing Legendre polynomials to improve the Adomian decomposition method is presented here and compared to the method of using Chebyshev polynomials. The presented modified Adomian decomposition method is validated through an example and advantage as well as efficiency of this method is verified through investigating and comparing the results. In this paper, it is concluded that both orthogonal polynomials: Chebyshev and Legendre polynomials can be successfully used for the Adomian decomposition method and comparatively the Chebyshev expansion provides the better estimation.     

Collocation points distributions for optimal spacecraft trajectories

The method of direct collocation with nonlinear programming (DCNLP) is a powerful tool to solve optimal control problems (OCP). In this method the solution time history is approximated with piecewise polynomials, which are constructed using interpolation points deriving from the Jacobi polynomials. Among the Jacobi polynomials family, Legendre and Chebyshev polynomials are the most used, but there is no evidence that they offer the best performance with respect to other family members. By solving different OCPs with interpolation points not only taken within the Jacoby family, the behavior of the Jacobi polynomials in the optimization problems is discussed. This paper focuses on spacecraft trajectories optimization problems. In particular orbit transfers, interplanetary transfers and station keepings are considered.     

Solution of nonlinear weakly singular Volterra integral equations using the fractional‐order Legendre functions and pseudospectral method

In this article, our main goal is to render an idea to convert a nonlinear weakly singular Volterra integral equation to a non‐singular one by new fractional‐order Legendre functions. The fractional‐order Legendre functions are generated by change of variable on well‐known shifted Legendre polynomials. We consider a general form of singular Volterra integral equation of the second kind. Then the fractional Legendre–Gauss–Lobatto quadratures formula eliminates the singularity of the kernel of the integral equation. Finally, the Legendre pseudospectral method reduces the solution of this problem to the solution of a system of algebraic equations. This method also can be utilized on fractional differential equations as well. The comparison of results of the presented method and other numerical solutions shows the efficiency and accuracy of this method. Also, the obtained maximum error between the results and exact solutions shows that using the present method leads to accurate results and fast convergence for solving nonlinear weakly singular Volterra integral equations. Copyright © 2015 John Wiley & Sons, Ltd.     

Two positivity conjectures for Kerov polynomials

Kerov polynomials express the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as polynomials in the “free cumulants” of the associated Young diagram. We present two positivity conjectures for their coefficients. The latter are stronger than the positivity conjecture of Kerov–Biane, recently proved by Féray.