Abstract
We describe an approximation scheme and an implementation technique that enables numerical computations with functions defined on domains with an arbitrary shape. The scheme is spectrally accurate for smooth functions. The main advantage of the technique is that, unlike most spectral approximation schemes in higher dimensions, it is not limited to domains with tensor-product structure. The scheme itself is a discrete least squares approximation in a redundant set (a frame) that originates from a basis on a bounding box. The implementation technique consists of representing a domain by its characteristic function, i.e., the function that indicates whether or not a point belongs to the set. We show in a separate paper that the least squares approximation with N degrees of freedom can be solved in \({\mathscr {O}}(N^2\log ^2 N)\) operations for any domain that has non-trivial volume. The computational cost improves to \({\mathscr {O}}(N \log ^2 N)\) operations for domains that do have tensor-product structure. The scheme applies to domains even with fractal shapes, such as the Mandelbrot set, since such domains are defined precisely by their characteristic function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The code is publicly available in the online GitHub repository of the FrameFuns package, http://github.com/daanhb/FrameFun.jl.
References
B. Adcock, D. Huybrechs, Frames and numerical approximation, Technical report TW-674, KU Leuven, December 2016
B. Adcock, D. Huybrechs, J. MartÃn-Vaquero, On the numerical stability of Fourier extensions. Found. Comput. Math. 14, 635–687 (2014)
D. Boffi, N. Cavallini, L. Gastaldi, The finite element immersed boundary method with distributed Lagrange multiplier. SIAM J. Numer. Anal. 53(6), 2584–2604 (2015)
T.A. Driscoll, N. Hale, L.N. Trefethen, Chebfun Guide (Pafnuty Publications, Oxford, 2014)
R.J. Duffin, A.C. Schaeffer, A class of nonharmonic Fourier series. Trans. Am. Math. Soc. 72(2), 341–366 (1952)
E.J. Kansa, Multiquadrics - a scattered data approximation scheme with applications to computational fluid-dynamics II: solutions to parabolic, hyperbolic and elliptic partial differential equations. Comput. Math. Appl. 19, 147–161 (1990)
F. Kasolis, E. Wadbro, M. Berggren, Analysis of fictitious domain approximations of hard scatterers. SIAM J. Numer. Anal. 2015(5), 2347–2362 (2015)
M. Lyon, A fast algorithm for Fourier continuation. SIAM J. Sci. Comput. 33(6), 3241–3260 (2011)
R. Matthysen, D. Huybrechs, Fast algorithms for the computation of Fourier extensions of arbitrary length. SIAM J. Sci. Comput. 36(2), 828–845 (2015)
R. Matthysen, D. Huybrechs, Multi-dimensional Fourier frame approximations through collocation, In preparation, (2017)
D. Shirokoff, J. C. Nave, A Sharp-interface active penalty method for the incompressible Navier–Stokes equations. J. Sci. Comput. 62(1), 53–77 (2015)
Acknowledgements
The authors are supported by FWO Flanders Projects G.A004.14 and G.0641.11
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Huybrechs, D., Matthysen, R. (2017). Computing with Functions on Domains with Arbitrary Shapes. In: Fasshauer, G., Schumaker, L. (eds) Approximation Theory XV: San Antonio 2016. AT 2016. Springer Proceedings in Mathematics & Statistics, vol 201. Springer, Cham. https://doi.org/10.1007/978-3-319-59912-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-59912-0_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59911-3
Online ISBN: 978-3-319-59912-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)