Efficient algorithms for computing the nearest polynomial with constrained roots

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 1998, Pages 236-243

  Hitz, Markus A ^a   Kaltofen, Erich ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PERTURBATION TECHNIQUES; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS; PROBLEM SOLVING; ROOT LOCI;

CONSTRAINED ROOTS; EUCLIDEAN DISTANCE; PIECEWISE PARAMETRIC CURVE;

ALGORITHMS;

EID: 0032514310     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/281508.281624     Document Type: Article

References (25)