Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
From MaRDI portal
Publication:5653490
DOI10.1093/COMJNL/15.2.156zbMath0242.65007OpenAlexW2142567026MaRDI QIDQ5653490
Publication date: 1972
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/15.2.156
Best approximation, Chebyshev systems (41A50) Numerical interpolation (65D05) Numerical differentiation (65D25)
Related Items (59)
Application of Rational Interpolations for Solving Boundary Value Problems with Singularities ⋮ Treecode-accelerated Green iteration for Kohn-Sham density functional theory ⋮ An extended Prony's interpolation scheme on an equispaced grid ⋮ Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials ⋮ Barycentric interpolation collocation methods for solving linear and nonlinear high-dimensional Fredholm integral equations ⋮ Fast multipole methods for approximating a function from sampling values ⋮ A treecode based on barycentric Hermite interpolation for electrostatic particle interactions ⋮ Pseudospectral methods for density functional theory in bounded and unbounded domains ⋮ Chebfun and numerical quadrature ⋮ Adaptive piecewise Poly-Sinc methods for function approximation ⋮ Barycentric formulas for interpolating trigonometric polynomials and their conjugates ⋮ On the condition number of Newton interpolation: Chebyshev points and monotonically ordering ⋮ Numerical analysis of the kinetic equation describing isotropic 4-wave interactions in non-linear physical systems ⋮ Fast barycentric rational interpolations for complex functions with some singularities ⋮ Dispersion relation reconstruction for 2D photonic crystals based on polynomial interpolation ⋮ A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal ⋮ Fast computation of the spectral differentiation by the fast multipole method ⋮ Linear rational interpolation and its application in approximation and boundary value problems ⋮ The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form ⋮ Adaptive point shifts in rational approximation with optimized denominator. ⋮ The stability of barycentric interpolation at the Chebyshev points of the second kind ⋮ Implicit QR for rank-structured matrix pencils ⋮ On the convergence rates of Legendre approximation ⋮ Tikhonov regularization for polynomial approximation problems in Gauss quadrature points ⋮ Chebfun: A New Kind of Numerical Computing ⋮ Matrices for the direct determination of the barycentric weights of rational interpolation ⋮ The effects of rounding errors in the nodes on barycentric interpolation ⋮ Numerical algorithm based on extended barycentric Lagrange interpolant for two dimensional integro-differential equations ⋮ A Kernel-Independent Treecode for General Rotne-Prager-Yamakawa Tensor ⋮ Numerical approximation of oscillatory integrals of the linear ship wave theory ⋮ A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation ⋮ Integral operators and delay differential equations ⋮ Barycentric rational interpolation with asymptotically monitored poles ⋮ On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity ⋮ Meshfree approach for solving multi-dimensional systems of Fredholm integral equations via barycentric Lagrange interpolation ⋮ A spectrally accurate direct solution technique for frequency-domain scattering problems with variable media ⋮ Hermite-Fejer interpolation at the ‘practical’ Chebyshev nodes ⋮ The linear rational collocation method ⋮ Optimized point shifts and poles in the linear rational pseudospectral method for boundary value problems ⋮ On algorithms for estimating computable error bounds for approximate periodic solutions of an autonomous delay differential equation ⋮ On the sensitivity to rounding errors of Chebyshev series approximations ⋮ Numerical analysis of the blow-up of one-dimensional polymer fluid flow with a front ⋮ Algorithm for solving the four-wave kinetic equation in problems of wave turbulence ⋮ An algorithm for the Burgers' equation using barycentric collocation method with a high-order exponential Lie-group scheme ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ A comprehensive comparison of algorithms for evaluating rational Bézier curves ⋮ Numerical analysis of a self-similar turbulent flow in Bose-Einstein condensates ⋮ Reusing Chebyshev points for polynomial interpolation ⋮ A characterisation of certain optimal collocation points for numerical differentiation ⋮ Some Problems in Optimally Stable Lagrangian Differentiation ⋮ Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method ⋮ Extended barycentric rational schemes for functions of singularities ⋮ Implementation of Neumann boundary condition with influence matrix method for viscous annular flow using pseudospectral collocation ⋮ Baryzentrische Formeln zur Trigonometrischen Interpolation. I ⋮ A closed formula for the Čebyšev barycentric weights of optimal approximation in \(H^ 2\) ⋮ The Fast Implementation of Higher Order Hermite--Fejér Interpolation ⋮ Exponential convergence of a linear rational interpolant between transformed Chebyshev points ⋮ The Landau problem on compact intervals and optimal numerical differentiation ⋮ The Chebyshev points of the first kind
This page was built for publication: Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
