Abstract
A fundamental problem in algebraic geometry is to decompose the solution set of a polynomial system. A numerical irreducible decomposition is a numerical description of this solution set. Standard algorithms to compute this use a sequence of several homotopies. Our new approach uses isosingular theory and a classical result to compute a smooth point on every irreducible component in every dimension with a single homotopy. Key words. Numerical irreducible decomposition, isosingular sets, numerical algebraic geometry, intersection theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
