partial+factorization

См. также в других словарях:

• Partial fractions in complex analysis — In complex analysis, a partial fraction expansion is a way of writing a meromorphic function f(z) as an infinite sum of rational functions and polynomials. When f(z) is a rational function, this reduces to the usual method of partial… …   Wikipedia

• Partial fraction — In algebra, the partial fraction decomposition or partial fraction expansion is a procedure used to reduce the degree of either the numerator or the denominator of a rational function (also known as a rational algebraic fraction). In symbols, one …   Wikipedia

• Invariant factorization of LPDOs — IntroductionFactorization of linear ordinary differential operators (LODOs) is known to be unique and in general, it finally reduces to the solution of a Riccati equation [http://en.wikipedia.org/wiki/Riccati equation] , i.e. factorization of… …   Wikipedia

• Unique factorization domain — In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element, with special exceptions, can be uniquely written as a product of prime elements, analogous to the fundamental theorem of… …   Wikipedia

• Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of …   Wikipedia

• Ruffini's rule — In mathematics, Ruffini s rule allows the rapid division of any polynomial by a binomial of the form x − r . It was described by Paolo Ruffini in 1809. Ruffini s rule is a special case of long division when the divisor is a linear factor. Ruffini …   Wikipedia

• Primality test — A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating… …   Wikipedia

• Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   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

• LU decomposition — In linear algebra, LU decomposition (also called LU factorization) is a matrix decomposition which writes a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as… …   Wikipedia

• Polar decomposition — In mathematics, particularly in linear algebra and functional analysis, the polar decomposition of a matrix or linear operator is a factorization analogous to the polar form of a nonzero complex number z where r is the absolute value of z (a… …   Wikipedia