Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots (1998)

by Markus A. Hitz
Citations:33 - 12 self

Document Versions

Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots –Markus A. Hitz — 1998
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots –Markus A. Hitz, Erich Kaltofen — 1998
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots –Markus A. Hitz, Erich Kaltofen — 1998 — In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC’99) (New
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems –Markus A. Hitz, Erich Kaltofen, Lakshman Y. N. — 1998 — IN PROC. 1999 INTERNAT. SYMP. SYMBOLIC ALGEBRAIC COMPUT. (ISSAC’99) (NEW
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems –Markus A. Hitz, Erich Kaltofen, Lakshman Y. N. — 1999 — In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC’99) (New