Related papers: On Fast Implementation of Clenshaw-Curtis and Fej\…
In this paper, we study the optimal general convergence rates for quadratures derived from Chebyshev points. By building on the aliasing errors on integration of Chebyshev polynomials, together with the asymptotic formulae on the…
We propose, analyze, and implement a quadrature method for evaluating integrals of the form $\int_0^2 f(s)\exp(zs)\, {\rm d}s$, where $z$ is a complex number with a possibly large negative real part. The integrand may exhibit exponential…
A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…
Filon-Clenshaw-Curtis rules are among rapid and accurate quadrature rules for computing highly oscillatory integrals. In the implementation of the Filon-Clenshaw-Curtis rules in the case when the oscillator function is not linear, its…
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…
A novel method which is called the Chebyshev inertial iteration for accelerating the convergence speed of fixed-point iterations is presented. The Chebyshev inertial iteration can be regarded as a valiant of the successive over relaxation…
In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the…
The problem of barycentric Hermite interpolation is highly susceptible to overflows or underflows. In this paper, based on Sturm-Liouville equations for Jacobi orthogonal polynomials, we consider the fast implementation on the second…
The efficient approximation of highly oscillatory integrals plays an important role in a wide range of applications. Whilst traditional quadrature becomes prohibitively expensive in the high-frequency regime, Levin methods provide a way to…
In this contribution we deal with Gaussian quadrature rules based on orthogonal polynomials associated with a weight function $w(x)= x^{\alpha} e^{-x}$ supported on an interval $(0,z)$, $z>0.$ The modified Chebyshev algorithm is used in…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
As one myth of polynomial interpolation and quadrature, Trefethen [30] revealed that the Chebyshev interpolation of $|x-a|$ (with $|a|<1 $) at the Clenshaw-Curtis points exhibited a much smaller error than the best polynomial approximation…
In this paper, we present a Clenshaw-Curtis-Filon-type method for the weakly singular oscillatory integral with Fourier and Hankel kernels. By interpolating the non-oscillatory and nonsingular part of the integrand at $(N+1)$…
We describe a fast, simple, and stable transform of Chebyshev expansion coefficients to Jacobi expansion coefficients and its inverse based on the numerical evaluation of Jacobi expansions at the Chebyshev--Lobatto points. This is achieved…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
In this paper we propose and analyse composite Filon-Clenshaw-Curtis quadrature rules for integrals of the form $I_{k}^{[a,b]}(f,g) := \int_a^b f(x) \exp(\mathrm{i}kg(x)) \rd x $, where $k \geq 0$, $f$ may have integrable singularities and…
Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…