The nearest polynomial with a given zero, and similar problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The nearest polynomial with a given zero, and similar problems

Full text

Pdf (245 KB)

Source

ACM SIGSAM Bulletin archive
Volume 33 , Issue 4 (December 1999) table of contents

Pages: 2 - 4

Year of Publication: 1999

ISSN:0163-5824

Author

Hans J. Stetter

Technical Univ., Vienna

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 14

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/500457.500458 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	F. Chaitin-Chatelin, V. Frayssé: Lectures on Finite Precision Computations, Software - Environments - Tools, SIAM, Philadelphia, 1996.
	2	Robert M. Corless , Patrizia M. Gianni , Barry M. Trager , Stephen M. Watt, The singular value decomposition for polynomial systems, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.195-207, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220371]
	3	Markus A. Hitz , Erich Kaltofen, Efficient algorithms for computing the nearest polynomial with constrained roots, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.236-243, August 13-15, 1998, Rostock, Germany [doi>10.1145/281508.281624]
	4	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 [doi>10.1145/309831.309937]
	5	N. K. Karmarkar , Y. N. Lakshman, On approximate GCDs of univariate polynomials, Journal of Symbolic Computation, v.26 n.6, p.653-666, Dec. 1998 [doi>10.1006/jsco.1998.0232]
	6	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]
	7	Ronald G Mosier, Root neighborhoods of a polynomial, Mathematics of Computation, v.47 n.175, p.265-273, July 1986 [doi>10.2307/2008093]
	8	W. Oetti, W. Prager: Compatibility of Approximate Solutions of Linear Equations with Given Error Bounds for Coefficients and Right Hand Sides, Numer. Math. 6 (1964) 405-409.
	9	H.J. Stetter: Polynomials with Coefficients of Limited Accuracy, in: Computer Algebra in Scientific Computing (Eds V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov), Springer, 1999, 409-430.
	10	K.-C. Toh, L.N. Trefethen: Pseudozeros of Polynomials and Pseudospectra of Companion Matrices, Numer. Math. 68 (1994) 403-425.

CITED BY 14

	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	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
	Robert M. Corless , Hiroshi Kai , Stephen M. Watt, Approximate computation of pseudovarieties, ACM SIGSAM Bulletin, v.37 n.3, September 2003
	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
	Stef Graillat, A note on a nearest polynomial with a given root, ACM SIGSAM Bulletin, v.39 n.2, June 2005
	Nargol Rezvani , Robert M. Corless, The nearest polynomial with a given zero, revisited, ACM SIGSAM Bulletin, v.39 n.3, September 2005
	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
	Marc Moreno Maza , Greg Reid , Robin Scott , Wenyuan Wu, On approximate triangular decompositions in dimension zero, Journal of Symbolic Computation, v.42 n.7, p.693-716, July, 2007
	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
	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
	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
	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, The nearest polynomial with a zero in a given domain, Theoretical Computer Science, v.409 n.2, p.282-291, December, 2008
	Hiroshi Sekigawa, On real factors of real interval polynomials, Journal of Symbolic Computation, v.44 n.7, p.908-922, July, 2009