Details:
| Title | | | Author(s) | Antonio Montes | | Type | Article in Journal | | Abstract | It is known that Groebner bases approach can be useful to solve systems of algebraic equations with a finite number of solutions. Nevertheless, as stated in [Bu], numerical accuracy attainable when using floating point arithmetic is not yet studied. In this paper we discuss numerical approach, defining conveniently the condition number of every root, and the numerical g.c.d.'s of Buchberger's algorithm. With these instruments we are able to compute confidence-intervals for the roots. We complete the study with two illustrative examples. We also give some insight about the best order of the variables when pure lexicographical order is concerned. | | ISSN | 0163-5824 |
| URL |
doi.acm.org/10.1145/152379.152387 |
| Language | English | | Journal | SIGSAM Bulletin | | Volume | 27 | | Number | 1 | | Pages | 12-19 | | Publisher | ACM Press | | Address | New York, NY, USA | | Year | 1993 | | Month | January | | Translation |
No | | Refereed |
No |
|
