When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of transforms - Wikipedia

    en.wikipedia.org/wiki/List_of_transforms

    Legendre transformation; Möbius transformation; Perspective transform (computer graphics) Sequence transform; Watershed transform (digital image processing) Wavelet transform (orthonormal) Y-Δ transform (electrical circuits)

  3. Sequence transformation - Wikipedia

    en.wikipedia.org/wiki/Sequence_transformation

    In mathematics, a sequence transformation is an operator acting on a given space of sequences (a sequence space).Sequence transformations include linear mappings such as discrete convolution with another sequence and resummation of a sequence and nonlinear mappings, more generally.

  4. Generating function transformation - Wikipedia

    en.wikipedia.org/wiki/Generating_function...

    These transformations typically involve integral formulas applied to a sequence generating function (see integral transformations) or weighted sums over the higher-order derivatives of these functions (see derivative transformations). Given a sequence, {} =, the ordinary generating function (OGF) of the sequence, denoted (), and the exponential ...

  5. Discrete Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_transform

    In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration ...

  6. Binomial transform - Wikipedia

    en.wikipedia.org/wiki/Binomial_transform

    In combinatorics, the binomial transform is a sequence transformation (i.e., a transform of a sequence) that computes its forward differences. It is closely related to the Euler transform, which is the result of applying the binomial transform to the sequence associated with its ordinary generating function.

  7. Möbius inversion formula - Wikipedia

    en.wikipedia.org/wiki/Möbius_inversion_formula

    Given an arithmetic function, one can generate a bi-infinite sequence of other arithmetic functions by repeatedly applying the first summation. For example, if one starts with Euler's totient function φ, and repeatedly applies the transformation process, one obtains: φ the totient function; φ ∗ 1 = I, where I(n) = n is the identity function

  8. Summation by parts - Wikipedia

    en.wikipedia.org/wiki/Summation_by_parts

    In mathematics, summation by parts transforms the summation of products of sequences into other summations, often simplifying the computation or (especially) estimation of certain types of sums. It is also called Abel's lemma or Abel transformation, named after Niels Henrik Abel who introduced it in 1826. [1]

  9. Transformation (function) - Wikipedia

    en.wikipedia.org/wiki/Transformation_(function)

    In mathematics, a transformation, transform, or self-map [1] is a function f, usually with some geometrical underpinning, that maps a set X to itself, i.e. f: X → X. [ 2 ] [ 3 ] [ 4 ] Examples include linear transformations of vector spaces and geometric transformations , which include projective transformations , affine transformations , and ...