Approximate polynomial decomposition

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximate polynomial decomposition

Full text

Pdf (698 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 213 - 219

Year of Publication: 1999

ISBN:1-58113-073-2

Authors

Robert M. Corless	Department of Computer Science, University of Western Outario, London, ON, N6A 5B7, Canada
Mark W. Giesbrecht	Department of Computer Science, University of Western Outario, London, ON, N6A 5B7, Canada
David J. Jeffrey	Department of Applied Mathematics, University of Western Outario, London, ON, N6A 5B7, Canada
Stephen M. Watt	Dept. of Computer Science and Dept. of Applied Mathematics, University of Western Outario, London, ON, N6A 5B7, Canada

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

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/309831.309939 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	Cesar Alonso , Jaime Gutierrez , Tomás Recio, A rational function decomposition algorithm by near-separated polynomials, Journal of Symbolic Computation, v.19 n.6, p.527-544, June 1995 [doi>10.1006/jsco.1995.1030]
	2	D R Barton , R Zippel, Polynomial decomposition algorithms, Journal of Symbolic Computation, v.1 n.2, p.159-168, June 1985 [doi>10.1006/jsco.1994.1009]
	3	BITMEAD. 1-~. I{.. AND ANDERSON, B. D. O. Asynlptotically fast solution of Toeplitz and related systems of equations. Linear Algebra and Appl. 34 (1980), }03- 116.
	4	R. P. Brent , H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM (JACM), v.25 n.4, p.581-595, Oct. 1978 [doi>10.1145/322092.322099]
	5	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 [doi>10.1145/281508.281622]
	6	GOLIJB, G. H., AND LOAN, C.. V. Matrix Computations, 3rd ed. Johns Hopkins: 1995.
	7	Ronald L. Graham , Donald E. Knuth , Oren Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1994
	8	Jaime Gutierrez , Tomás Recio , C. Ruiz de Velasco, Polynomial Decomposition Algorithm of Almost Quadratic Complexity, Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.471-475, July 04-08, 1988
	9	K6aNEI~, T. \V. Fourier Analysis. Cambridge University Press, 1988.
	10	Dexter Kozen , Susan Landau, Polymonial decomposition algorithms, Journal of Symbolic Computation, v.7 n.5, p.445-456, May 1989 [doi>10.1016/S0747-7171(89)80027-6]
	11	V. Pan, Parallel least-squares solution of general and Toeplitz systems, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.244-253, July 02-06, 1990, Island of Crete, Greece [doi>10.1145/97444.97691]
	12	PAN, V., AND SCHREIBER, R. A fast, preconditioned conjugate gradient Toeplitz soh:er. Comp. Math. A ppl. 24, 7 (1992). 17.24.
	13	RIVLIN. T. Chcbyshev polynomials: firm approximation theory to number theory. Vv-iley: 1990.
	14	TRE.~CII, \V. An algorithm for t.he inversion of finite Toeplitz matrices. SIAM J. Applied Mathematics 12 (1964), 515. 522.
	15	J. von zur Gathen, Functional decomposition of polynomials: the Tame case, Journal of Symbolic Computation, v.9 n.3, p.281-299, March 1990 [doi>10.1016/S0747-7171(08)80014-4]
	16	Richard Zippel, Rational function decomposition, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.1-6, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120695]

CITED BY 3

	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
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	Sonia Pérez-Díaz , Juana Sendra , J. Rafael Sendra, Parametrization of approximate algebraic curves by lines, Theoretical Computer Science, v.315 n.2-3, p.627-650, 6 May 2004