Optimization strategies for the approximate GCD problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimization strategies for the approximate GCD problem

Full text

Pdf (269 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: 228 - 235

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Paulina Chin	Department of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, N2L 3C5, Canada
Robert M. Corless	Department of Applied Mathematics, University of Western Ontario, London, Ontario, N6A 5B7, Canada
George F. Corliss	Department of Mathematics, Statistics, and Computer Science, Marquette University, P.O. Box 1881, Milwaukee, WI

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): 21, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

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.281622 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	Bernhard Beckermann , George Labahn, A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials, Journal of Symbolic Computation, v.26 n.6, p.691-714, Dec. 1998 [doi>10.1006/jsco.1998.0235]
	2	Bernhard Beckermann , George Labahn, When are two numerical polynomials relatively prime?, Journal of Symbolic Computation, v.26 n.6, p.677-689, Dec. 1998 [doi>10.1006/jsco.1998.0234]
	3	BRANCH, M. A., AND GRACE, A. MATLAB Optimization Toolbox User's Guide. The MathWorks, Inc., 1996.
	4	W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM (JACM), v.18 n.4, p.478-504, Oct. 1971 [doi>10.1145/321662.321664]
	5	Chi-Tsong Chen, Linear System Theory and Design, Saunders College Publishing, Philadelphia, PA, 1984
	6	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]
	7	Robert M. Corless, Cofactor iteration, ACM SIGSAM Bulletin, v.30 n.1, p.34-38, March 1996 [doi>10.1145/231191.231197]
	8	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]
	9	CORLISS, G. F., Hu, C., KEARFOTT, R. B., AND WAL- STER, G. W. Global solutions working note 1: Rigorous global search- executive summary. Tech. Rep. 442, Dept. of Mathematics, Statistics and Computer Science, Marquette University, Milwaukee, WI, 1997.
	10	J. E. Dennis, Jr. , Robert B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16), Soc for Industrial & Applied Math, 1996
	11	EMIRIS, I. Z. Symbolic-numeric algebra for polynomials. Research Report, Institut National de Recherche en Informatique et en Automatique (INRIA), Sophia- Antipolis, France, 1997.
	12	EMIRIS, I. Z., GALLIGO, A., AND LOMBARDI, H. Numerical univariate polynomial GCD. In The Mathematics of Numerical Analysis, Lectures in Applied Mathematics V. 32, J. Renegar, M. Shub, and S. Smale, Eds. AMS, 1996, pp. 323-343.
	13	EMIRIS, I. Z., GALLIGO, A., AND LOMBARDI, H. Certified approximate univariate GCDs. J. Pure and Applied Algebra 117 $J 118 (1997), 229-251.
	14	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]
	15	KARCANIAS, N., AND MITROULI, M. A matrix pencil based numerical method for the computation of the GCD of polynomials. IEEE Trans. Automatic Control 39 (1994), 977-981.
	16	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]
	17	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]
	18	KEARFOTT, R. B. Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht, Netherlands, 1996.
	19	MOR~, J. J., AND WRIGHT, S. J. Optimization Software Guide. SIAM, 1994.
	20	Matu-Tarow Noda , Tateaki Saaski, Approximate GCD and its application to ill-conditioned algebraic equations, Journal of Computational and Applied Mathematics, v.38 n.1-3, p.335-351, Dec. 23, 1991
	21	PAN, V. Y. Numerical computation of a polynomial GCD and extensions. Research Report 2969, Institut National de Recherche en Informatique et en Automatique (INRIA), Sophia-Antipolis, France, 1996.
	22	SCHONHAGE, A. Quasi-GCD computations. J. Complexity 1 (1985), 118-137.
	23	SEDERBERG, T. W., AND CHANG, G.-Z. Best linear common divisors for approximate degree reduction. Computer-Aided Design 25 (1993), 163-168.
	24	WILKINSON, J. g. The perfidious polynomial. In Studies in Numerical Analysis, G. H. Golub, Ed. The Mathematical Association of America, 1984, pp. 1-28.

CITED BY 8

	Robert M. Corless , Mark W. Giesbrecht , David J. Jeffrey, Approximate polynomial decomposition, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.213-219, July 28-31, 1999, Vancouver, British Columbia, Canada
	Zhonggang Zeng, A method computing multiple roots of inexact polynomials, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.266-272, August 03-06, 2003, Philadelphia, PA, USA
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	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
	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
	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
	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
	Akira Terui, An iterative method for calculating approximate GCD of univariate polynomials, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, July 28-31, 2009, Seoul, Republic of Korea