Sciweavers

10 search results - page 1 / 2
» An Algorithm for Computing the Complete Root Classification ...
Sort
View
AISC
2006
Springer
13 years 9 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 10 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
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 7 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
ENGL
2008
192views more  ENGL 2008»
13 years 5 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
TCS
2008
13 years 5 months ago
Real algebraic numbers and polynomial systems of small degree
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
Ioannis Z. Emiris, Elias P. Tsigaridas