Algorithms for trigonometric polynomials

Authors:
Jamie Mulholland;Michael Monagan
Affiliations:
Univ. of British Columbia, Vancouver, B.C., Canada;Simon Fraser Univ., Burnaby, B.C., Canada
Venue:
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Year:
2001

Citing 1
Cited 3

An overlooked example of nonunique factorization

American Mathematical Monthly

Understanding expression simplification

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Rational simplification modulo a polynomial ideal

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A canonical form for piecewise defined functions

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

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).