Abstract

The border bases were generalized to general polynomial ideals (zero and positive dimensional ideals). A new algorithm to compute a border basis for a given polynomial system w.r.t. a specified term order was presented. This algorithm computes a border basis, as well as a reduced Grobner basis for the polynomial system. A particular eigenvector method to find some components of positive dimensional polynomial systems was sketched too.

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 call

Disclaimer: 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.