Abstract. It was shown by P. J. Davis that the Newton-Cotes quadrature formula is convergent if the integrand is an analytic function that is regular in a sufficiently large region of the complex plane containing the interval of integration. In the present paper, a bound on the error of the Newton-Cotes quadrature formula for analytic functions is derived. Also the bounds on the Legendre polyno...

Random regression test-day models using Legendre polynomials are commonly used for the estimation of genetic parameters and genetic evaluation for test-day milk production traits. However, some researchers have reported that these models present some undesirable properties such as the overestimation of variances at the edges of lactation. Describing genetic variation of saturated fatty acids ex...

abstract. the main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. properties of the legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. afterwards, an iterative algorithm is examined for solvin...

in this paper, a numerical efficient method is proposed for the solution of time fractionalmobile/immobile equation. the fractional derivative of equation is described in the caputosense. the proposed method is based on a finite difference scheme in time and legendrespectral method in space. in this approach the time fractional derivative of mentioned equationis approximated by a scheme of order o...

Gauss–Legendre quadrature rules are of considerable theoretical and practical interest because of their role in numerical integration and interpolation. In this paper, a series expansion for the zeros of the Legendre polynomials is constructed. In addition, a series expansion useful for the computation of the Gauss–Legendre weights is derived. Together, these two expansions provide a practical ...

-The discrete Legendre transform is compared to the discrete cosine transform (DCT), which is based on Chebyshev polynomials, in terms of image compression efficiency. Using standard test images in various image compression configurations, the DCT is found to perform marginally better than the discrete Legendre transform in all cases examined. A simplified fundamental matrix theory for construc...

A general framework is introduced to analyze the approximation properties of mapped Legendre polynomials and of interpolations based on mapped Legendre–Gauss–Lobatto points. Optimal error estimates featuring explicit expressions on the mapping parameters for several popular mappings are derived. These results not only play an important role in numerical analysis of mapped Legendre spectral and ...

These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show that two of the Mahonian polynomials are cyclic sieving polynomials for certain Dual Hamming Codes: X and X inv for q = 2, 3 and q = 2, respectively.

We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in the families of Legendre, Jacobi, Hessian and Edwards curves.