self-convolution
Смотреть что такое "self-convolution" в других словарях:
Small-angle X-ray scattering — (SAXS) is a small angle scattering (SAS) technique where the elastic scattering of X rays (wavelength 0.1 ... 0.2 nm) by a sample which has inhomogeneities in the nm range, is recorded at very low angles (typically 0.1 10°). This angular range… … Wikipedia
Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… … Wikipedia
Sound from ultrasound — Contents 1 Parametric array 2 Applications 2.1 Commercial advertising … Wikipedia
Soliton (optics) — In optics, the term soliton is used to refer to any optical field that does not change during propagation because of a delicate balance between nonlinear and linear effects in the medium. There are two main kinds of solitons: spatial solitons:… … Wikipedia
Central limit theorem — This figure demonstrates the central limit theorem. The sample means are generated using a random number generator, which draws numbers between 1 and 100 from a uniform probability distribution. It illustrates that increasing sample sizes result… … Wikipedia
On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Path integral formulation — This article is about a formulation of quantum mechanics. For integrals along a path, also known as line or contour integrals, see line integral. The path integral formulation of quantum mechanics is a description of quantum theory which… … Wikipedia
Refinable function — In mathematics, in the area of wavelet analysis, a refinable function is a function which fulfills some kind of self similarity. A function varphi is called refinable with respect to the mask h if:varphi(x)=2cdotsum {k=0}^{N 1} h… … Wikipedia
Oja's rule — Oja s learning rule, or simply Oja s rule, named after a Finnish computer scientist Erkki Oja, is a model of how neurons in the brain or in artificial neural networks change connection strength, or learn, over time. It is a modification of the… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
