Abstract

By restricting Buchberger’s procedure so as to match practical ones and extending the structure of subresultant considerably, we develop a subresultant-like theory for Buchberger’s procedure of Grobner basis computation. As an application of the theory, we clarify the mechanism of main-term cancellation which is the main origin of instability of the computation of Grobner bases with floating-point numbers.

Full Text
Paper version not known

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.