An adaptive partition of unity method for Chebyshev polynomial interpolation
From MaRDI portal
Publication:4602899
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.
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
Cites work
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
- A radial basis function partition of unity collocation method for convection-diffusion equations arising in financial applications
- An Extension of MATLAB to Continuous Functions and Operators
- Approximation theory and approximation practice
- Chopping a Chebyshev Series
- On the exponentially slow motion of a viscous shock
- Optimal domain splitting for interpolation by Chebyshev polynomials
- Piecewise-smooth chebfuns
- Reconstructing multi-scale variational partition of unity implicit surfaces with attributes
- Rectangular spectral collocation
- Scattered Data Approximation
- Smooth interpolation of large sets of scattered data
- Spectral Methods in MATLAB
- The chebop system for automatic solution of differential equations
- Two Dimensional Interpolation from Random Data
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
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)
