The nearest polynomial of lower degree

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The nearest polynomial of lower degree

Full text

Pdf (89 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 2007 international workshop on Symbolic-numeric computation table of contents

London, Ontario, Canada

SESSION: Contributed extended abstracts table of contents

Pages: 199 - 200

Year of Publication: 2007

ISBN:978-1-59593-744-5

Authors

Robert M. Corless	University of Western Ontario, London, Canada
Nargol Rezvani	University of Toronto, Toronto, Canada

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 0

Additional Information:

references 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/1277500.1277530 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	Young Joon Ahn , Byung-Gook Lee , Yunbeom Park , Jaechil Yoo, Constrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients, Computer Aided Geometric Design, v.21 n.2, p.181-191, February 2004 [doi>10.l016/j.cagd.2003.10.001]
	2	Guido Brunnett , Thomas Schreiber , Jörg Braun, The geometry of optimal degree reduction of Be´zier curves, Computer Aided Geometric Design, v.13 n.8, p.773-788, Nov. 1996 [doi>10.1016/0167-8396(96)00009-X]
	3	R. M. Corless, N. Rezvani, and A. Amiraslani. Pseudospectra of matrix polynomials that are expressed in alternative bases. Math. & Comp. Sci,, to appear, 2007.
	4	R. M. Corless and S. M. Watt. Bernstein bases are optimal, but, sometimes, Lagrange bases are better. In Proc. SYNASC, pp. 141--153, 2004.
	5	Ronald L. Graham , Donald E. Knuth , Oren Patashnik, Concrete Math, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988
	6	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]
	7	Nargol Rezvani , Robert M. Corless, The nearest polynomial with a given zero, revisited, ACM SIGSAM Bulletin, v.39 n.3, September 2005 [doi>10.1145/1113439.1113442]
	8	N. Rezvani Dehaghani. Approximate polynomials in different bases. Master's thesis, University of Western Ontario, December 2005.
	9	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 [doi>10.1145/500457.500458]