An adaptive partition of unity method for Chebyshev polynomial interpolation
From MaRDI portal
Publication:4602899
DOI10.1137/17M112052XzbMATH Open1380.65134arXiv1708.02611MaRDI QIDQ4602899FDOQ4602899
Authors: Kevin W. Aiton, Tobin A. Driscoll 
Publication date: 7 February 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Abstract: For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these cases splitting the interval and using piecewise interpolation can accelerate convergence. Chebfun includes a splitting mode that finds an optimal splitting through recursive bisection, but the result has no global smoothness unless conditions are imposed explicitly at the breakpoints. An alternative is to split the domain into overlapping intervals and use an infinitely smooth partition of unity to blend the local Chebyshev interpolants. A simple divide-and-conquer algorithm similar to Chebfun's splitting mode can be used to find an overlapping splitting adapted to features of the function. The algorithm implicitly constructs the partition of unity over the subdomains. This technique is applied to explicitly given functions as well as to the solutions of singularly perturbed boundary value problems.
Full work available at URL: https://arxiv.org/abs/1708.02611
Recommendations
- Optimal domain splitting for interpolation by Chebyshev polynomials
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation
- Chebyshev interpolation with approximate nodes of unrestricted multiplicity
- On the uniform convergence of the Chebyshev interpolants for solitons
- On the optimal convergence rates of Chebyshev interpolations for functions of limited regularity
Numerical interpolation (65D05) Numerical differentiation (65D25) Numerical solution of singularly perturbed problems involving ordinary differential equations (65L11)
Cites Work
- The chebop system for automatic solution of differential equations
- Piecewise-smooth chebfuns
- Spectral Methods in MATLAB
- An Extension of MATLAB to Continuous Functions and Operators
- A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
- Approximation theory and approximation practice
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- Smooth interpolation of large sets of scattered data
- Reconstructing multi-scale variational partition of unity implicit surfaces with attributes
- Scattered Data Approximation
- Two Dimensional Interpolation from Random Data
- On the exponentially slow motion of a viscous shock
- A radial basis function partition of unity collocation method for convection-diffusion equations arising in financial applications
- Rectangular spectral collocation
- Optimal domain splitting for interpolation by Chebyshev polynomials
- Chopping a Chebyshev Series
Cited In (6)
- Path-following methods for calculating linear surface wave dispersion relations on vertical shear flows
- An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
- Functional Tucker approximation using Chebyshev interpolation
- Optimal domain splitting for interpolation by Chebyshev polynomials
- Spectral methods for capillary surfaces described by bounded generating curves
- Adaptive partition of unity interpolation method with moving patches
Uses Software
This page was built for publication: An adaptive partition of unity method for Chebyshev polynomial interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602899)
