Efficient algorithms for computing the nearest polynomial with constrained roots

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient algorithms for computing the nearest polynomial with constrained roots

Full text

Pdf (276 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1998 international symposium on Symbolic and algebraic computation table of contents

Rostock, Germany

Pages: 236 - 243

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Markus A. Hitz	Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
Erich Kaltofen	Mathematics Department, North Carolina State University, Raleigh, NC

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 20

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/281508.281624 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	B. R. Barmish , H. I. Kang, A survey of extreme point results for robustness of control systems, Automatica (Journal of IFAC), v.29 n.1, p.13-35, Jan. 1993 [doi>10.1016/0005-1098(93)90172-P]
	2	Jie Chen , Michael K. H. Fan , Carl N. Nett, Structured singular values and stability analysis of uncertain polynomials, part 1: the generalized &mgr;, Systems & Control Letters, v.23 n.1, p.53-65, July 1994 [doi>10.1016/0167-6911(94)90081-7]
	3	Jie Chen , Michael K. H. Fan , Carl N. Nett, Structured singular values and stability analysis of uncertain polynomials, part 2: a missing link, Systems & Control Letters, v.23 n.2, p.97-109, Aug. 1994 [doi>10.1016/0167-6911(94)90039-6]
	4	Thomas F. Coleman , Yuying Li, A global and quadratically convergent method for linear l ∞ problems, SIAM Journal on Numerical Analysis, v.29 n.4, p.1166-1186, Aug. 1992 [doi>10.1137/0729071]
	5	Alfredo C. Desages , Liliana Castro , Hernán Cendra, Distance of a complex coefficient stable polynomial from the boundary of the stability set, Multidimensional Systems and Signal Processing, v.2 n.2, p.189-210, May 1991 [doi>10.1007/BF01938223]
	6	ECKER~ J. (~.~ AND KUPFERSCHMID~ M. Introduction to Operations Research. John Wiley & Sons, New York, N.Y., 1988.
	7	GANTMACHER, F. R. Matriz Theory. Chelsea Publishing Company, New York, N.Y., 1959.
	8	GOLUB, G. H., AND VAN LOAN, C. F. Matriz Computations, 1~t ed. The John Hopkins University Press, Baltimore, M.D., 1983.
	9	Markus Alois Hitz , Erich Kaltofen , Joseph E. Flaherty, Efficient algorithms for computing the nearest polynomial with constrained roots, 1998
	10	JOYA, K., AND FURUTA, K. Criteria for Schur and ~-stability of a family of polynomials constrained with /P-norm. In Proc. IEEE Conf. Dec. and Control (1991), pp. 433-434.
	11	N. Karmarkar , Y. N. Lakshman, Approximate polynomial greatest common divisors and nearest singular polynomials, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.35-39, July 24-26, 1996, Zurich, Switzerland [doi>10.1145/236869.236892]
	12	KARMARKAR, N., AND LAKSHMAN, Y. N. On approximate GCDs of univariate polynomials. Submitted for publication (1997).
	13	KHARITONOV~ V. L. Asymptotic stability of an equilibrium position of a family of systems of linear differential equations. Differensial'nye Uravnenya 14, 11 (1978), 2086-2088.
	14	KHARITONOV, V. L. On 3o generalization of a stability criterion. Akademii hank Kazakhskoi SSR, Seria fizikomathematicheskaia 1 (1978), 53-57.
	15	KHARITONOV~ V. L. Asymptotic stability of an equilibrium position of a family of systems of linear differential equations. Differential Equations 14 (1979), 1483-1485.
	16	KOGAN, J. How near is a stable polynomial to an unstable polynomial? IEEE Trans. Circuits Syst. I CAS-39, 8 (1992), 676-680.
	17	KREIN, ~/{. G., AND NAIMARK, ~/{. A. The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations. Linear and Multilinear Algebra 10 (1981), 265-308. Originally published in Russian, Kharkov (1936).
	18	MARDEN, M. Geometry of Polynomials, 2~d ed. Mathematical Surveys, Number 3. American Mathematical Society, Providence, R.I., 1966.
	19	P~REZ, F., ABDALLAH, C., AND D., D. Robustness analysis of polynomials with linearly correlated uncertain coefficients in /P-normed balls. In Proc. IEEE Conf. Dec. and Control (1994), pp. 2996-2997.
	20	L. Qiu , E. J. Davison, A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations, Systems & Control Letters, v.13 n.5, p.413-420, Dec. 1989 [doi>10.1016/0167-6911(89)90108-4]
	21	RANTZER~ A. Stability conditions for polytopes of polynomials. IEEE Trans. Auto. Control AC-37, 1 (1992), 79-89.
	22	STIEFEL~ E. /Jber diskrete und lineare Tschebyscheff- Approximationen. Numerische Mathematik 1 (1959), 1-28.
	23	STIEFEL~ E. Note on Jordan elimination, linear programming and Tschebyscheff approximation. Numerische Mathematik 2 (1960), 1-17.
	24	TEMPO~ R. A simple test for Schur stability of a diamond of complex polynomials. In Proc. IEEE Conf. Dec. and Control (1989), pp. 1892-1895.
	25	TSYPKIN, Y. Z., AND POLYAK, B. T. Frequency domain criteria for/P-robust stability of continuous linear systems. IEEE Trans. Auto. Control AC-36 (1991), 1464-1469.

CITED BY 20

	Nargol Rezvani , Robert M. Corless, The nearest polynomial with a given zero, revisited, ACM SIGSAM Bulletin, v.39 n.3, September 2005
	Hans J. Stetter, The nearest polynomial with a given zero, and similar problems, ACM SIGSAM Bulletin, v.33 n.4, p.2-4, 12/01/1999
	Stef Graillat, A note on a nearest polynomial with a given root, ACM SIGSAM Bulletin, v.39 n.2, June 2005
	Hiroshi Sekigawa, The nearest polynomial with a zero in a given domain, Proceedings of the 2007 international workshop on Symbolic-numeric computation, July 25-27, 2007, London, Ontario, Canada
	Robert M. Corless , Stephen M. Watt, Report on the SNAP minisymposium at SIAM '98, ACM SIGSAM Bulletin, v.32 n.2, p.35-37, June 1998
	Hiroshi Sekigawa, The nearest polynomial with a zero in a given domain from a geometrical viewpoint, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, July 20-23, 2008, Linz/Hagenberg, Austria
	Robert M. Corless , Nargol Rezvani, The nearest polynomial of lower degree, Proceedings of the 2007 international workshop on Symbolic-numeric computation, July 25-27, 2007, London, Ontario, Canada
	Hiroshi Sekigawa , Kiyoshi Shirayanagi, Locating real multiple zeros of a real interval polynomial, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
	Hiroshi Sekigawa, On real factors of real interval polynomials, Proceedings of the 2007 international symposium on Symbolic and algebraic computation, July 29-August 01, 2007, Waterloo, Ontario, Canada
	Markus A. Hitz , Erich Kaltofen , Y. N. Lakshman, Efficient algorithms for computing the nearest polynomial with a real root and related problems, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.205-212, July 28-31, 1999, Vancouver, British Columbia, Canada
	Hiroshi Sekigawa, The nearest polynomial with a zero in a given domain, Theoretical Computer Science, v.409 n.2, p.282-291, December, 2008
	Lihong Zhi, Numerical optimization in hybrid symbolic-numeric computation, Proceedings of the 2007 international workshop on Symbolic-numeric computation, July 25-27, 2007, London, Ontario, Canada
	Scott R. Pope , Agnes Szanto, Nearest multivariate system with given root multiplicities, Journal of Symbolic Computation, v.44 n.6, p.606-625, June, 2009
	Erich Kaltofen , John May, On approximate irreducibility of polynomials in several variables, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.161-168, August 03-06, 2003, Philadelphia, PA, USA
	Erich Kaltofen , Bin Li , Zhengfeng Yang , Lihong Zhi, Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, July 20-23, 2008, Linz/Hagenberg, Austria
	Erich Kaltofen , Zhengfeng Yang , Lihong Zhi, Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
	Hoon Hong , Erich Kaltofen , Michael Singer, East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters, ACM SIGSAM Bulletin, v.33 n.2, p.43-52, June 1999
	Markus A. Hitz, On computing nearest singular hankel matrices, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, p.171-176, July 24-27, 2005, Beijing, China
	J. William Hoffman , James J. Madden , Hong Zhang, Pseudozeros of multivariate polynomials, Mathematics of Computation, v.72 n.242, p.975-1002, 1 April 2003
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003