Title
A Stabilized Normal Form Algorithm for Generic Systems of Polynomial Equations.
Abstract
We propose a numerical linear algebra based method to find the multiplication operators of the quotient ring C[x]∕I associated to a zero-dimensional ideal I generated by n C-polynomials in n variables. We assume that the polynomials are generic in the sense that the number of solutions in Cn equals the Bézout number. The main contribution of this paper is an automated choice of basis for C[x]∕I, which is crucial for the feasibility of normal form methods in finite precision arithmetic. This choice is based on numerical linear algebra techniques and it depends on the given generators of I.
Year
DOI
Venue
2018
10.1016/j.cam.2018.04.021
Journal of Computational and Applied Mathematics
Keywords
DocType
Volume
Polynomial systems,Macaulay matrix,Numerical linear algebra,Multiplication matrices,Normal forms
Journal
342
ISSN
Citations 
PageRank 
0377-0427
1
0.41
References 
Authors
7
2
Name
Order
Citations
PageRank
Simon Telen110.75
Marc Van Barel229445.82