discrete sum
Смотреть что такое "discrete sum" в других словарях:
Discrete Morse theory — is a combinatorial adaptation of Morse theory defined on finite CW complexes. Contents 1 Notation regarding CW complexes 2 Discrete Morse functions 3 The Morse complex … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Discrete Laplace operator — For the discrete equivalent of the Laplace transform, see Z transform. In mathematics, the discrete Laplace operator is an analog of the continuous Laplace operator, defined so that it has meaning on a graph or a discrete grid. For the case of a… … Wikipedia
Discrete wavelet transform — An example of the 2D discrete wavelet transform that is used in JPEG2000. The original image is high pass filtered, yielding the three large images, each describing local changes in brightness (details) in the original image. It is then low pass… … Wikipedia
Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… … Wikipedia
Discrete sine transform — In mathematics, the discrete sine transform (DST) is a Fourier related transform similar to the discrete Fourier transform (DFT), but using a purely real matrix. It is equivalent to the imaginary parts of a DFT of roughly twice the length,… … Wikipedia
Discrete group — Concepts in group theory category of groups subgroups, normal subgroups group homomorphisms, kernel, image, quotient direct product, direct sum semidirect product, wreath product … Wikipedia
Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… … Wikipedia
Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… … Wikipedia
Discrete probability distribution — In probability theory, a probability distribution is called discrete if it is characterized by a probability mass function. Thus, the distribution of a random variable X is discrete, and X is then called a discrete random variable, if:sum u… … Wikipedia
Barycentric-sum problem — Combinatorial number theory deals with number theoretic problems which involve combinatorial ideas in their formulations or solutions. Paul Erdős is the main founder of this branch of number theory. Typical topics include covering system, zero… … Wikipedia
