ACM Home Page
Please provide us with feedback. Feedback
Matrix eigenproblems are at the heart of polynomial system solving
Full text PdfPdf (379 KB)
Source ACM SIGSAM Bulletin archive
Volume 30 ,  Issue 4  (December 1996) table of contents
Pages: 22 - 25  
Year of Publication: 1996
ISSN:0163-5824
Author
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 28,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/242961.242966
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] W. Auzinger, H.J. Stetter: An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, in: Intern. Series in Numer. Math. (Birkhäuser) vol. 86, 11-30, 1988.
 
2
3
 
4
[4] D. Lazard: Résolution des systèmes d'équations algébriques, Theor. Comp. Sci 15, 77-110, 1981.
 
5
[5] M.G. Marinari, H.M. Moeller, T. Mora: Groebner duality and multiplicities in polynomial system solving , to appear in Trans. AMS.
 
6
 
7
[7] H.J. Stetter: Multivariate polynomial equations as matrix eigenproblems, in: Series in Applicable Analysis (World Scientific) vol. 2, 355-371, 1993.

CITED BY  11