In mathematics, a bump function (also called a test function) is a function on a Euclidean space which is both smooth (in the sense of having continuous derivatives of all orders) and compactly supported. The set of all bump functions with domain forms a vector space, denoted or The dual space of this space endowed with a suitable topology is the space of distributions.
The function given by
is an example of a bump function in one dimension. It is clear from the construction that this function has compact support, since a function of the real line has compact support if and only if it has bounded closed support. The proof of smoothness follows along the same lines as for the related function discussed in the Non-analytic smooth function article. This function can be interpreted as the Gaussian function scaled to fit into the unit disc: the substitution corresponds to sending to
A simple example of a (square) bump function in variables is obtained by taking the product of copies of the above bump function in one variable, so
Smooth transition functions
Consider the function
defined for every real number x.
The function
has a strictly positive denominator everywhere on the real line, hence g is also smooth. Furthermore, g(x) = 0 for x ≤ 0 and g(x) = 1 for x ≥ 1, hence it provides a smooth transition from the level 0 to the level 1 in the unit interval [0, 1]. To have the smooth transition in the real interval [a, b] with a < b, consider the function
For real numbers a < b < c < d, the smooth function
equals 1 on the closed interval [b, c] and vanishes outside the open interval (a, d), hence it can serve as a bump function.
Caution must be taken since, as example, taking , leads to:
which is not a infinitely differentiable function (so, is not "smooth"), so the constraints a < b < c < d must be strictly fulfilled.
Some interesting facts about the function:
Are that make smooth transition curves with "almost" constant slope edges (behaves like inclined straight lines on a non-zero measure interval).
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
We develop, analyze and implement numerical algorithms to solve optimization problems of the form: min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Rieman
The goal of this course is to introduce the student to modern numerical methods for the solution of coupled & non-linear problems arising in geo-mechanics / geotechnical engineering.
In mathematics, the Cauchy principal value, named after Augustin Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined. In this method, a singularity on an integral interval is avoided by limiting the integral interval to the singularity (so the singularity is not covered by the integral). Depending on the type of singularity in the integrand f, the Cauchy principal value is defined according to the following rules: In some cases it is necessary to deal simultaneously with singularities both at a finite number b and at infinity.
In mathematics, Schwartz space is the function space of all functions whose derivatives are rapidly decreasing. This space has the important property that the Fourier transform is an automorphism on this space. This property enables one, by duality, to define the Fourier transform for elements in the dual space of , that is, for tempered distributions. A function in the Schwartz space is sometimes called a Schwartz function. Schwartz space is named after French mathematician Laurent Schwartz.
In mathematical analysis, the smoothness of a function is a property measured by the number of continuous derivatives it has over some domain, called differentiability class. At the very minimum, a function could be considered smooth if it is differentiable everywhere (hence continuous). At the other end, it might also possess derivatives of all orders in its domain, in which case it is said to be infinitely differentiable and referred to as a C-infinity function (or function).
Learn to optimize on smooth, nonlinear spaces: Join us to build your foundations (starting at "what is a manifold?") and confidently implement your first algorithm (Riemannian gradient descent).
We consider the problem of provably finding a stationary point of a smooth function to be minimized on the variety of bounded-rank matrices. This turns out to be unexpectedly delicate. We trace the difficulty back to a geometric obstacle: On a nonsmooth se ...
SPRINGER HEIDELBERG2022
, , ,
This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayesoptimal test error for classification while obtaining (nearly) zero-trai ...
2023
We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...