An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
From MaRDI portal
Publication:5241266
DOI10.1137/18M1184904MaRDI QIDQ5241266
Kevin W. Aiton, Tobin A. Driscoll
Publication date: 30 October 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.00423
Related Items
Adaptive partition of unity interpolation method with moving patches ⋮ Preconditioned Nonlinear Iterations for Overlapping Chebyshev Discretizations with Independent Grids
Uses Software
Cites Work
- On the numerical stability of Fourier extensions
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- On the resolution power of Fourier extensions for oscillatory functions
- Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
- On the Fourier Extension of Nonperiodic Functions
- Chopping a Chebyshev Series
- A Primer on Radial Basis Functions with Applications to the Geosciences
- Algorithm 847
- Function Approximation on Arbitrary Domains Using Fourier Extension Frames
- An Adaptive Partition of Unity Method for Chebyshev Polynomial Interpolation
- An Extension of MATLAB to Continuous Functions and Operators
- Chebfun in Three Dimensions
- Continuous analogues of matrix factorizations
- An Extension of Chebfun to Two Dimensions
- Reconstructing multi-scale variational partition of unity implicit surfaces with attributes
- A fast, high-order algorithm for the solution of surface scattering problems: Basic implementation, tests, and applications
