Floating point Gröbner bases

Bracket coefficients for polynomials are introduced. These are like specific precision floating point numbers together with error terms. Working in terms of bracket coefficients, an algorithm that computes a Gröbner basis with floating point coefficients is presented, and a new criterion for determi...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics and computers in simulation 1996, Vol.42 (4), p.509-528
Main Author: Shirayanagi, Kiyoshi
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bracket coefficients for polynomials are introduced. These are like specific precision floating point numbers together with error terms. Working in terms of bracket coefficients, an algorithm that computes a Gröbner basis with floating point coefficients is presented, and a new criterion for determining whether a bracket coefficient is zero is proposed. Given a finite set F of polynomials with real coefficients, let G μ be the result of the algorithm for F and a precision value μ, and G be a true Gröbner basis of F. Then, as μ approaches infinity, G μ converges to G coefficientwise. Moreover, there is a precision M such that if μ ≥ M, then the sets of monomials with non-zero coefficients of G μ and G are exactly the same. The practical usefulness of the algorithm is suggested by experimental results.
ISSN:0378-4754
1872-7166
DOI:10.1016/S0378-4754(96)00027-4