Matrix factorization of a polynomial
Appearance
![]() |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
A matrix factorization of a polynomial is an 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
References
- ^ 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–35. doi:10.1090/S0002-9947-1980-0570778-7. ISSN 0002-9947.
- ^ Crisler, David; Diveris, Kosmas, Matrix Factorizations of Sums of Squares Polynomials (PDF)
External links
- Matrix Factorization - A Numberphile video about the topic
- A Mathematica implementation of a algorithm to matrix-factorize polynomials
This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles. (July 2020) |