Using Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components

By Andrew J. Sommese, Jan Verschelde, Charles W. Wampler II. 2001

92 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Mechanics, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/82b1d5b57d7d4629aff2c3e93e23e7d26f46eefd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Andrew J. Sommese
2. Charles W. Wampler II
3. Daniel J. Bates
4. Ye Lu
5. Jan Verschelde

In Computational Mechanics

1. Andrew J. Sommese
2. Charles W. Wampler II
3. Daniel J. Bates
4. Ye Lu
5. Jan Verschelde

In Computational Theory and Mathematics

1. Andrew J. Sommese
2. Charles W. Wampler II
3. Daniel J. Bates
4. Ye Lu
5. Jan Verschelde
6. Xianwen Kong
7. Jonathan D. Hauenstein
8. Paul Breiding

Citations in the corpus

• Finding All Real Points of a Complex Curve (2006, methodology): “This material is based upon work supported by the National Science Foundation under Grant No. 0105653 and Grant No. 0410047; and the Duncan Chair of the University of Notre Dame.”
• Advances in Polynomial Continuation for Solving Problems in Kinematics (2004, methodology): “Instead of interpolation, we can apply the monodromy algorithm of [21] to detect irreducible components, using linear traces to validate the groupings [22].”