Ramp function

The ramp function is a unary real function, whose graph is shaped like a ramp. It can be expressed by numerous definitions, for example "0 for negative inputs, output equals input for non-negative inputs". The term "ramp" can also be used for other functions obtained by scaling and shifting, and the function in this article is the unit ramp function (slope 1, starting at 0).

Graph of the ramp function

This function has numerous applications in mathematics and engineering, and goes by various names, depending on the context.

Definitions

The ramp function (R(x) : ℝ → ℝ0+) may be defined analytically in several ways. Possible definitions are:

  • A piecewise function:
  • The max function:
  • The mean of an independent variable and its absolute value (a straight line with unity gradient and its modulus):
this can be derived by noting the following definition of max(a,b),
for which a = x and b = 0
  • The Heaviside step function multiplied by a straight line with unity gradient:
  • The convolution of the Heaviside step function with itself:
  • The integral of the Heaviside step function:[1]
  • Macaulay brackets:

Applications

The ramp function has numerous applications in engineering, such as in the theory of digital signal processing.

Payoff and profits from buying a call option.

In finance, the payoff of a call option is a ramp (shifted by strike price). Horizontally flipping a ramp yields a put option, while vertically flipping (taking the negative) corresponds to selling or being "short" an option. In finance, the shape is widely called a "hockey stick", due the shape being similar to an ice hockey stick.

A mirrored pair of hinge functions with a knot at x=3.1

In statistics, hinge functions of multivariate adaptive regression splines (MARS) are ramps, and are used to build regression models.

In machine learning, it is commonly known as the rectifier used in rectified linear units (ReLUs).

Analytic properties

Non-negativity

In the whole domain the function is non-negative, so its absolute value is itself, i.e.

and

  • Proof: by the mean of definition 2, it is non-negative in the first quarter, and zero in the second; so everywhere it is non-negative.

Derivative

Its derivative is the Heaviside function:

Second derivative

The ramp function satisfies the differential equation:

where δ(x) is the Dirac delta. This means that R(x) is a Green's function for the second derivative operator. Thus, any function, f(x), with an integrable second derivative, f″(x), will satisfy the equation:

Fourier transform

where δ(x) is the Dirac delta (in this formula, its derivative appears).

Laplace transform

The single-sided Laplace transform of R(x) is given as follows,[2]

Algebraic properties

Iteration invariance

Every iterated function of the ramp mapping is itself, as

  • Proof:

This applies the non-negative property.

gollark: I like to ensure that my code is SAFE and COOL by writing idiomatic Haskell, then randomly adding `unsafePerformIO` and more monads to it.
gollark: Performance is, in my opinion, mostly less important than safety and correctness.
gollark: Go's loops are literally metaphorically Satan.
gollark: Rust's loops use iterators, which is neat and consistent.
gollark: Oh, vaguely like sinth's Unsafe thing? Did that go anywhere?

See also

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.