- row transform
- мат. строчное преобразование (матрицы)
Большой англо-русский и русско-английский словарь. 2001.
row transform
Смотреть что такое "row transform" в других словарях:
Row equivalence — In linear algebra, two matrices are row equivalent if one can be changed to the other by a sequence of elementary row operations. Alternatively, two m times; n matrices are row equivalent if and only if they have the same row space. The concept… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Extract, transform, load — Extract, transform and load (ETL) is a process in database usage and especially in data warehousing that involves: Extracting data from outside sources Transforming it to fit operational needs (which can include quality levels) Loading it into… … 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
Burrows-Wheeler transform — The Burrows Wheeler transform (BWT, also called block sorting compression), is an algorithm used in data compression techniques such as bzip2. It was invented by Michael Burrows and David Wheeler in 1994 while working at DEC Systems Research… … Wikipedia
Boustrophedon transform — In mathematics, the boustrophedon transform is a procedure which maps one sequence to another. The transformed sequence is computed by filling a triangle in boustrophedon (zig zag) manner.DefinitionGiven a sequence (a 0, a 1, a 2, ldots), the… … 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
Binomial transform — In combinatorial mathematics the binomial transform is a sequence transformation (ie, 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… … Wikipedia
Motor Row District — Motor Row Historic District U.S. National Register of Historic Places U.S. Historic district … Wikipedia
Groovy (programming language) — Infobox programming language name = Groovy paradigm = object oriented, scripting year = 2003 designer = JCP developer = Guillaume Laforge (Project Manager and JSR 241 Spec Lead) latest release version = 1.5.7 latest release date = release… … Wikipedia
DFT matrix — A DFT matrix is an expression of a discrete Fourier transform (DFT) as a matrix multiplication. Contents 1 Definition 2 Examples 2.1 Two point 2.2 Four point … Wikipedia
