- nonlinear decomposition
- мат. нелинейное разложение
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Decomposition method — is a generic term for solutions of various problems and design of algorithms in which the basic idea is to decompose the problem into question into subproblems. The term may specifically refer to one of the following. Decomposition method… … Wikipedia
Nonlinear regression — See Michaelis Menten kinetics for details In statistics, nonlinear regression is a form of regression analysis in which observational data are modeled by a function which is a nonlinear combination of the model parameters and depends on one or… … Wikipedia
Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… … Wikipedia
Cholesky decomposition — In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a Hermitian, positive definite matrix into the product of a lower triangular matrix and its conjugate transpose. It was discovered by André Louis Cholesky… … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia
CP decomposition — In multilinear algebra, the canonical polyadic decomposition (CPD), historically known as PARAFAC and later CANDECOMP, is a generalization of the matrix singular value decomposition (SVD) to tensors, with many applications in in statistics,… … Wikipedia
Dulmage-Mendelsohn decomposition — In graph theory, the Dulmage Mendelsohn decomposition is a method used to create a maximal matching on a bipartite graph.It has been used to partition meshes in Finite Element Analysis, and to determine specified, underspecified and overspecified … Wikipedia
Dulmage–Mendelsohn decomposition — In graph theory, the Dulmage–Mendelsohn decomposition is a method used to create a maximal matching on a bipartite graph. It has been used to partition meshes in finite element analysis, and to determine specified, underspecified and… … Wikipedia
Reynolds decomposition — In fluid dynamics and the theory of turbulence, Reynolds decomposition is a mathematicaltechnique to separate the average and fluctuating parts of a quantity.For example, for a quantity scriptstyle u the decomposition would be:u(x,y,z,t) =… … Wikipedia
Adomian decomposition method — [Solving Frontier problems of Physics: The decomposition method, by G. Adomian 1994 Kluwer Academic Publishers] The Adomian decomposition method (ADM) is a non numerical method for solving nonlinear differential equations, both ordinary and… … Wikipedia
Empirical Mode Decomposition — EMD (англ. Empirical Mode Decomposition) метод разложения сигналов на функции, которые получили название «эмпирических мод». Метод EMD представляет собой итерационную вычислительную процедуру, в результате которой исходные данные… … Википедия