Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1813029 |
Changed an Item |
||
| Property / author | |||
| Property / author: Daniel A. Lichtblau / rank | |||
Normal rank | |||
Revision as of 14:43, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs |
scientific article |
Statements
Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (English)
0 references
25 July 2013
0 references
The author deals with approximate Gröbner bases and approximate GCD's (univariate and multivariate cases) computation. In this direction, he provides several examples to show that how certain considerations of tolerance allow us to obtain good approximate results. For this purpose, he uses his implementations in \textsc{Mathematica}.
0 references
approximate Gröbner bases
0 references
approximate GCD's
0 references
