English
Related papers

Related papers: Superconvergence Points of Spectral Interpolation

200 papers

If L is a complete ortholattice, f any partial function from L^n to L, then there is a complete ortholattice L* containing L as a subortholattice, and an ortholattice polynomial with coefficients in L* which represents f on L^n. Iterating…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

Mathematical Physics · Physics 2014-11-03 Maryna Nesterenko , Jiri Patera , Agnieszka Tereszkiewicz

The main objective of this paper is to give a wide study on the conformable fractional Legendre polynomials (CFLPs). This study is assumed to be a generalization and refinement, in an easy way, of the scalar case into the context of the…

Classical Analysis and ODEs · Mathematics 2020-06-18 Mhmoud Abul-Ez , Ali Youssef , Mohra Zayed , Manuel De la Sen

It is well-known that univariate cubic spline interpolation, if carried out on point sets with fill distance $h$, converges only like ${\cal O}(h^2)$ in $L_2[a,b]$ for functions in $W_2^2[a,b]$ if no additional assumptions are made. But…

Numerical Analysis · Mathematics 2016-07-15 Robert Schaback

In this paper, we find explicit formulas for higher order derivatives of the inverse tangent function. More precisely, we study polynomials which are induced from the higher-order derivatives of arctan(x). Successively, we give generating…

Classical Analysis and ODEs · Mathematics 2017-12-12 Mohamed Amine Boutiche , Mourad Rahmani

Classical Schur analysis is intimately connected to the theory of orthogonal polynomials on the circle [Simon, 2005]. We investigate here the connection between multipoint Schur analysis and orthogonal rational functions. Specifically, we…

Classical Analysis and ODEs · Mathematics 2010-02-11 L. Baratchart , S. Kupin , V. Lunot , M. Olivi

We study the numerical differentiation formulae for functions given in grids with arbitrary number of nodes. We investigate the case of the infinite number of points in the formulae for the calculation of the first and the second…

Numerical Analysis · Mathematics 2025-10-20 Maxim Dvornikov

Interpolation inequalities in Triebel-Lizorkin-Lorentz spaces and Besov-Lorentz spaces are studied for both inhomogeneous and homogeneous cases. First we establish interpolation inequalities under quite general assumptions on the parameters…

Functional Analysis · Mathematics 2021-09-17 Jaeseong Byeon , Hyunseok Kim , Jisu Oh

We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…

Classical Analysis and ODEs · Mathematics 2023-08-17 Jing Gao , Arieh Iserles

Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…

Numerical Analysis · Mathematics 2023-09-04 Ludovico Bruni Bruno , Wolfgang Erb

Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…

Numerical Analysis · Mathematics 2024-02-21 John Spitzer

This research is concerned with finding the roots of a function in an interval using Chebyshev Interpolation. Numerical results of Chebyshev Interpolation are presented to show that this is a powerful way to simultaneously calculate all the…

Numerical Analysis · Mathematics 2018-10-11 Tianyu Sun

We compare the convergence behavior of best polynomial approximations and Legendre and Chebyshev projections and derive optimal rates of convergence of Legendre projections for analytic and differentiable functions in the maximum norm. For…

Numerical Analysis · Mathematics 2021-12-30 Haiyong Wang

When an approximant is accurate on the interval, it is only natural to try to extend it to several-dimensional domains. In the present article, we make use of the fact that linear rational barycentric interpolants converge rapidly toward…

Numerical Analysis · Mathematics 2022-04-11 Jean-Paul Berrut , Giacomo Elefante

Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…

Commutative Algebra · Mathematics 2018-11-07 Uwe Nagel , Bill Trok

In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…

Numerical Analysis · Mathematics 2023-09-07 Martin Buhmann , Janin Jäger , Joaquín Jódar , Miguel L. Rodríguez

Based on the Hilb type formula between Jacobi polynomials and Bessel functions, optimal decay rates on Jacobi expansion coefficients are derived, by applying van der Corput type lemmas, for functions of logarithmatic singularities, which…

Numerical Analysis · Mathematics 2020-06-09 Shuhuang Xiang

We present and analyze an approximation scheme for a class of highly oscillatory kernel functions, taking the 2D and 3D Helmholtz kernels as examples. The scheme is based on polynomial interpolation combined with suitable pre- and…

Numerical Analysis · Mathematics 2018-03-07 Steffen Börm , Jens Markus Melenk

Given $E_0, E_1, F_0, F_1, E$ rearrangement invariant function spaces, $a_0$, $a_1$, $b_0$, $b_1$, $b$ slowly varying functions and $0< \theta_0<\theta_1<1$, we characterize the interpolation spaces $$(\overline{X}^{\mathcal…

Functional Analysis · Mathematics 2021-03-17 Pedro Fernández-Martínez , Teresa M. Signes

A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…

Numerical Analysis · Mathematics 2024-12-11 R. Connor Greene