Sciweavers

31 search results - page 1 / 7
» Efficient Algorithms for Computing the Nearest Polynomial wi...
Sort
View
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 7 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
13 years 7 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
COMPGEOM
2001
ACM
13 years 7 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
CAP
2010
12 years 10 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan