Related papers: Chebyshev Interpolation for Function in 1D
The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential)…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
It is needed to solve generalized eigenvalue problems (GEP) in many applications, such as the numerical simulation of vibration analysis, quantum mechanics, electronic structure, etc. The subspace iteration is a kind of widely used…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…
We show that product Chebyshev polynomial meshes can be used, in a fully discrete way, to evaluate with rigorous error bounds the Lebesgue constant, i.e. the maximum of the Lebesgue function, for a class of polynomial projectors on cube,…
In this paper, we first apply the Fitzpatrick algorithm to osculatory rational interpolation. Then based on Fitzpatrick algorithm, we present a Neville-like algorithm for Cauchy interpolation. With this algorithm, we can determine the value…
The calculation and manipulation of large multi-variable rational functions is a key bottleneck in multi-loop calculations. In these conference proceedings, based on my article [Chawdhry (2023) arXiv:2312.03672], I present a technique to…
In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…
One parameter subgroups of the group of hyperbolons of volume one when exploited accurately allow one to define and investigate higher order hyperbolic-trigonometric generalization of corresponding polynomials. In parallel functions of…
This paper addresses the challenge of function approximation using Hermite interpolation on equally spaced nodes. In this setting, standard polynomial interpolation suffers from the Runge phenomenon. To mitigate this issue, we propose an…
In this article, we prove the following interpolation problem: if the composition of a function and a regular map between affine varieties is a regular function, then there exists a global regular function of the target variety that…
The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline…
Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately…
Basing on invariant properties of universal multifractals we propose a simple algorithm for interpolation of multifractal densities. The algorithm admits generalization to a multidimensional case. Analitically obtained are multifractal…
An efficient method for finding all real roots of a univariate function in a given bounded domain is formulated. The proposed method uses adaptive mesh refinement to locate bracketing intervals based on bisection criterion for root finding.…
This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…
According to Lidstone interpolation theory, an entire function of exponential type $<\pi$ is determined by it derivatives of even order at $0$ and $1$. This theory can be generalized to several variables. Here we survey the theory for a…
We obtain definite integrals for products of associated Legendre functions with Bessel functions, associated Legendre functions, and Chebyshev polynomials of the first kind using orthogonality and integral transforms.
A C++ software design is presented that can be used to interpolate data in any number of dimensions. The design is based on a combination of templates of functional collections of elements and so-called type lists. The design allows for…