Approximate polynomial greatest common divisors and nearest singular polynomials

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximate polynomial greatest common divisors and nearest singular polynomials

Full text

Pdf (536 KB)

Source

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

Zurich, Switzerland

Pages: 35 - 39

Year of Publication: 1996

ISBN:0-89791-796-0

Authors

N. Karmarkar	Mathematical Sciences Research Center, Bell Laboratories, Murray Hill, NJ
Y. N. Lakshman	Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA

Sponsors

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): 2, Downloads (12 Months): 17, Citation Count: 19

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/236869.236892 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	A.SCHONHAGE. Quasi-gcd computations. Journal of Complexity 1 (1985), 118-137.
	2	David Granville Hough, Explaining and ameliorating the ill condition of zeros of polynomials., 1977
	3	George E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM (JACM), v.14 n.1, p.128-142, Jan. 1967 [doi>10.1145/321371.321381]
	4	George E. Collins, The Calculation of Multivariate Polynomial Resultants, Journal of the ACM (JACM), v.18 n.4, p.515-532, Oct. 1971 [doi>10.1145/321662.321666]
	5	D. Yu. Grigor'ev , N. N. Vorobjov, Solving systems of polynomial inequalities in subexponential time, Journal of Symbolic Computation, v.5 n.1-2, p.37-64, February/April 1988 [doi>10.1016/S0747-7171(88)80005-1]
	6	James Renegar, On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination, Journal of Symbolic Computation, v.13 n.3, p.301-327, March 1992
	7	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]
	8	V. Hribernig , H. J. Stetter, Detection and validation of clusters of polynomial zeros, Journal of Symbolic Computation, v.24 n.6, p.667-681, Dec. 1997 [doi>10.1006/jsco.1997.0160]
	9	W. S. Brown , J. F. Traub, On Euclid's Algorithm and the Theory of Subresultants, Journal of the ACM (JACM), v.18 n.4, p.505-514, Oct. 1971 [doi>10.1145/321662.321665]

CITED BY 19

	Bin Li , Jiawang Nie , Lihong Zhi, Approximate GCDs of polynomials and SOS relaxation, Proceedings of the 2007 international workshop on Symbolic-numeric computation, July 25-27, 2007, London, Ontario, Canada
	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
	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
	Joab R. Winkler , John D. Allan, Structured total least norm and approximate GCDs of inexact polynomials, Journal of Computational and Applied Mathematics, v.215 n.1, p.1-13, May, 2008
	Bingyu Li , Zhuojun Liu , Lihong Zhi, A fast algorithm for solving the Sylvester structured total least squares problem, Signal Processing, v.87 n.10, p.2313-2319, October, 2007
	Zhonggang Zeng , Barry H. Dayton, The approximate GCD of inexact polynomials, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.320-327, July 04-07, 2004, Santander, Spain
	André Galligo , Stephen Watt, A numerical absolute primality test for bivariate polynomials, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.217-224, July 21-23, 1997, Kihei, Maui, Hawaii, United States
	Bin Li , Jiawang Nie , Lihong Zhi, Approximate GCDs of polynomials and sparse SOS relaxations, Theoretical Computer Science, v.409 n.2, p.200-210, December, 2008
	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
	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
	Jiawang Nie , James Demmel , Ming Gu, Global minimization of rational functions and the nearest GCDs, Journal of Global Optimization, v.40 n.4, p.697-718, April 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
	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
	Paulina Chin , Robert M. Corless , George F. Corliss, Optimization strategies for the approximate GCD problem, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.228-235, August 13-15, 1998, Rostock, Germany
	Robert M. Corless , Mark W. Giesbrecht , Mark van Hoeij , Ilias S. Kotsireas , Stephen M. Watt, Towards factoring bivariate approximate polynomials, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.85-92, July 2001, London, Ontario, Canada
	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
	Victor Y. Pan, Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.68-77, January 25-27, 1998, San Francisco, California, United States
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003