Numerical Approximation of Generalized Functions: Aliasing, the Gibbs Phenomenon and a Numerical Uncertainty Principle

  • Guidotti P
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A general recipe for high-order approximation of generalized functions is introduced which is based on the use of L2-orthonormal bases consisting of C ∞ -functions and the appropriate choice of a discrete quadrature rule. Particular attention is paid to maintaining the distinction between point-wise functions (that is, which can be evaluated point-wise) and linear functionals defined on spaces of smooth functions (that is, distributions). It turns out that ``best'' point-wise approximation and ``best'' distributional approximation cannot be achieved simultaneously. This entails the validity of a kind of ``numerical uncertainty principle'': The local value of a function and its action as a linear functional on test functions cannot be known at the same time with high accuracy, in general.

Cite

CITATION STYLE

APA

Guidotti, P. (2007). Numerical Approximation of Generalized Functions: Aliasing, the Gibbs Phenomenon and a Numerical Uncertainty Principle. In Functional Analysis and Evolution Equations (pp. 331–356). Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7794-6_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free