Book
Four lectures on polynomial absolute factorization.
| Title: | Four lectures on polynomial absolute factorization. |
|---|---|
| Authors: | Dickenstein, Alicia, Emiris, Ioannis Z., Chèze, Guillaume, Galligo, André |
| Source: | Solving Polynomial Equations; 2005, p339-392, 54p |
| Abstract: | Polynomial factorization is one of the main chapters of Computer Algebra. Recently, significant progress was made on absolute factorization (i.e., over the complex field) of a multivariate polynomial with rational coefficients, with two families of algorithms proposing two different strategies of computation. One is represented by Gao’s algorithm and is explained in Lecture 2. The other is represented by the Galligo-Rupprecht-Chèze algorithm, presented in Lectures 4 and 5. The latter relies on an original use of the monodromy map attached to a generic projection of a plane curve on a line. It also involves zero-sums relations (introduced by Sasaki and his collaborators) with efficient semi-numerical computations to produce a certified exact result. [ABSTRACT FROM AUTHOR] |
| Subject Terms: | POLYNOMIALS, FACTORIZATION, ALGEBRA, COMPUTER algorithms, MATHEMATICS |
| Copyright of Solving Polynomial Equations is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| DOI: | 10.1007/3-540-27357-39 |
| Database: | Complementary Index |
Availability