Numerical factorization of multivariate complex polynomials

One can consider the problem of factoring multivariate complex polynomials as a special case of the decomposition of a pure dimensional solution set of a polynomial system into irreducible components. The importance and nature of this problem however justify a special treatment. We exploit the reduc...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 315; no. 2; pp. 651 - 669
Main Authors:	Sommese, Andrew J., Verschelde, Jan, Wampler, Charles W.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06.05.2004
Subjects:	Approximate factorization Divided differences Generic points Homotopy continuation Irreducible decomposition Monodromy Multiple roots Newton interpolation Numerical algebraic geometry Polynomial Stewart–Gough platform Symbolic-numeric computation Traces Witness points Polynomial 68W30 Secondary 65H10 Divided differences 14Q99 Multiple roots Traces Irreducible decomposition Monodromy Approximate factorization Newton interpolation Symbolic-numeric computation Primary 13P05 Homotopy continuation Witness points Stewart–Gough platform Generic points Numerical algebraic geometry
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!