ACM Home Page
Please provide us with feedback. Feedback
Algorithms for trigonometric polynomials
Full text PdfPdf (585 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 2001 international symposium on Symbolic and algebraic computation table of contents
London, Ontario, Canada
Pages: 245 - 252  
Year of Publication: 2001
ISBN:1-58113-417-7
Authors
Jamie Mulholland  Univ. of British Columbia, Vancouver, B.C., Canada
Michael Monagan  Simon Fraser Univ., Burnaby, B.C., Canada
Sponsor
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 27,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/384101.384135
What is a DOI?

ABSTRACT

In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonometric polynomials, that is, polynomials in sin(x) and cos(x).


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
Koepf, W., Bernig A., Melenk H. (1999) TRIGSIMP: A REDUCE Package for the Simplification and Factorization of Trigonometric and Hyperbolic Expressions. REDUCE 7 documentation.
 
2
Hungerford, T.W. (1980) Algebra, second edition, Graduate Texts in Mathematics, Springer-Verlag.
 
3
Roach, K. (1992), Trigonometric Factorization and Integration, Unpublished manuscript. Presented at the Maple Retreat, June, 1992.
 
4


Collaborative Colleagues:
Jamie Mulholland: colleagues
Michael Monagan: colleagues