Abbott, J. and Bigatti, A. and Kreuzer, Martin and Robbiano, L. (2000) Computing ideals of points. JOURNAL OF SYMBOLIC COMPUTATION, 30 (4). pp. 341-356. ISSN 0747-7171
Full text not available from this repository. (Request a copy)Abstract
We address the problem of computing ideals of polynomials which vanish at a finite set of points. In particular we develop a modular Buchberger-Moller algorithm, best suited for the computation over Q, and study its complexity; then we describe a variant for the computation of ideals of projective points, which uses a direct approach and a new stopping criterion. The described algorithms are implemented in CoCoA, and we report some experimental timings. (C) 2000 Academic Press.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | ; |
| Subjects: | 500 Science > 510 Mathematics |
| Divisions: | Mathematics |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 23 Mar 2022 05:38 |
| Last Modified: | 23 Mar 2022 05:38 |
| URI: | https://pred.uni-regensburg.de/id/eprint/42184 |
Actions (login required)
 |
View Item |
