We address the problem of computing ideals of polynomials which vanish at a finite set of points. In particular we develop a modular Buchberger-Moeller algorithm, best suited for the computation over QQ, 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
Let X be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal I(X) independent of the data uncertainty. We present a method to compute a polynomial basis B of I(X) which exhibits structural stability, that is, if e X is any set of points differing only slightly from X, there exists a polynomial set e B structurally similar to B, which is a basis of the perturbed ideal I( e X).
We present a new algorithm for refining a real interval containing a single real root: the new method combines characteristics of the classical Bisection algorithm and Newton's Iteration. Our method exhibits quadratic convergence when refining isolating intervals of simple roots of polynomials (and other well-behaved functions). We assume the use of arbitrary precision rational arithmetic. Unlike Newton's Iteration our method does not need to evaluate the derivative.
Abstract. Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC 2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC 2 community.
This paper is a natural continuation of Abbott et al. (2000) further generalizing the Buchberger-Möller algorithm to zero-dimensional schemes in both affine and projective spaces. We also introduce a new, general way of viewing the problems which can be solved by the algorithm: an approach which looks to be readily applicable in several areas. Implementation issues are also addressed, especially for computations over Q where a trace-lifting paradigm is employed. We give a complexity analysis of the new algorithm for fat points in affine space over Q.
In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in [WGD1982] (for reconstructing a rational number from correct modular images), and also of an algorithm presented by Abbott in [Abb1991] for reconstructing an integer value from several residue-modulus pairs, some of which may be incorrect. We compare our heuristic method with that of Böhm, Decker, Fieker and Pfister [BDFP2012].
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.