Related papers: Superoscillations with arbitrary polynomial shape
Superoscillating functions, i.e., functions that locally oscillate at a rate faster than their highest Fourier component, are of interest for applications from fundamental physics to engineering. Here, we develop a new method which allows…
We report a method for constructing bandpass functions that approximate a given analytic function with arbitrary accuracy over a finite interval. A corollary is that bandpass functions can be obtained that oscillate arbitrarily slower than…
Superoscillations are band-limited functions that can oscillate faster than their fastest Fourier component. These functions (or sequences) appear in weak values in quantum mechanics and in many fields of science and technology such as…
A recipe is presented for constructing band-limited superoscillating functions that exhibit arbitrarily high frequencies over arbitrarily long intervals.
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
We introduce a new numerically stable method for constructing superoscillatory wave forms inan arbitrary number of dimensions. The method allows the construction of superoscillatory square-integrable functions that match any desired smooth…
Surprisingly, differentiable functions are able to oscillate arbitrarily faster than their highest Fourier component would suggest. The phenomenon is called superoscillation. Recently, a practical method for calculating superoscillatory…
We give a general strategy to construct superoscillating/growing functions using an orthogonal polynomial expansion of a bandlimited function. The degree of superoscillation/growth is controlled by an anomalous expectation value of a…
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
This paper considers filtered polynomial approximations on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$, obtained by truncating smoothly the Fourier series of an integrable function $f$ with the help of a "filter" $h$, which is a…
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
Superoscillatory wave forms, i.e., waves that locally oscillate faster than their highest Fourier component, possess unusual properties that make them of great interest from quantum mechanics to signal processing. However, the more…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
A fully implementable filtered polynomial approximation on spherical shells is considered. The method proposed is a quadrature-based version of a filtered polynomial approximation. The radial direction and the angular direction of the…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…