In mathematics, a matrix factorization of a polynomial is a technique for factoring irreducible polynomials with matrices. David Eisenbud proved that every multivariate real-valued polynomial p without linear terms can be written as a AB = pI, where A and B are square matrices and I is the identity matrix.[1] Given the polynomial p, the matrices A and B can be found by elementary methods.[2]
Example:
The polynomial x2 + y2 is irreducible over R[x,y], but can be written as
^Eisenbud, David (1980-01-01). "Homological algebra on a complete intersection, with an application to group representations". Transactions of the American Mathematical Society. 260 (1): 35. doi:10.1090/S0002-9947-1980-0570778-7. ISSN 0002-9947.
^Crisler, David; Diveris, Kosmas, Matrix Factorizations of Sums of Squares Polynomials(PDF)
and 25 Related for: Matrix factorization of a polynomial information
integer factorization of 15, and (x – 2)(x + 2) is apolynomialfactorizationof x2 – 4. Factorization is not usually considered meaningful within number...
study these is amatrixfactorization known as either the PolynomialMatrix Spectral Factorization or the Matrix Fejer–Riesz Theorem. Given a univariate positive...
mathematics and computer algebra, factorizationofpolynomials or polynomialfactorization expresses apolynomial with coefficients in a given field or in the integers...
mathematics and computer algebra the factorizationofapolynomial consists of decomposing it into a product of irreducible factors. This decomposition...
square-free factorizationof the polynomial, which provides polynomials whose roots are the roots ofa given multiplicity of the original polynomial. The greatest...
eigendecomposition is the factorizationofamatrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors...
test irreducibility and to compute the factorization into irreducible polynomials (see Factorizationofpolynomials). These algorithms are not practicable...
semidefinite matrixA as BTB = A, as in the Cholesky factorization, even if BB ≠ A. This distinct meaning is discussed in Positive definite matrix § Decomposition...
means that the Vandermonde matrix is the design matrixofpolynomial regression. In numerical analysis, solving the equation V a = y {\displaystyle Va=y}...
methods of solution are computationally much more efficient. Determinants are used for defining the characteristic polynomialofa square matrix, whose...
algorithm attempts to set up a congruence of squares modulo n (the integer to be factorized), which often leads to afactorizationof n. The algorithm works...
The Chebyshev polynomials are two sequences ofpolynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)} and...
Furthermore, a similar factorization holds for any n × n rotation matrix. If the dimension, n, is odd, there will be a "dangling" eigenvalue of 1; and for any...
situation is better than for integer factorization, as there are factorization algorithms that have apolynomial complexity. They are implemented in most...
pivoting is necessary for a strictly column diagonally dominant matrix when performing Gaussian elimination (LU factorization). The Jacobi and Gauss–Seidel...
constant α > 1 {\displaystyle \alpha >1} is apolynomial time algorithm. The following table summarizes some classes of commonly encountered time complexities...
precisely, it is apolynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number...
algebra include obtaining matrix decompositions like the singular value decomposition, the QR factorization, the LU factorization, or the eigendecomposition...
roots of the determinant function. This is a continuous function because it is apolynomial in the entries of the matrix. Thus in the language of measure...
Cholesky factorization (pronounced /ʃəˈlɛski/ shə-LES-kee) is a decomposition ofa Hermitian, positive-definite matrix into the product ofa lower triangular...
require factorization, and explicitly mentions "primary" when the form using factorization is meant. When trying to find out whether two square matrices A and...
multiplication operator by a trigonometric polynomial, compressed to a finite-dimensional space, can be represented by such amatrix. Similarly, one can represent...
known factorization, then the eigenvalues ofA lie among its roots. For example, a projection is a square matrix P satisfying P2 = P. The roots of the corresponding...
Global Information![{\displaystyle \left[{\begin{array}{cc}x&-y\\y&x\end{array}}\right]\left[{\begin{array}{cc}x&y\\-y&x\end{array}}\right]=(x^{2}+y^{2})\left[{\begin{array}{cc}1&0\\0&1\end{array}}\right]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/8c6602bba2981e7886239fc1eeebbc33006b361c)