Floating point Gröbner bases

Kiyoshi Shirayanagi

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 42, issue 4, 509-528

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

Date: 1996
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475496000274
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:42:y:1996:i:4:p:509-528

DOI: 10.1016/S0378-4754(96)00027-4

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().