Algorithms for trigonometric polynomials

15 years 7 months ago

Download www.cecm.sfu.ca

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

Jamie Mulholland, Michael B. Monagan

Real-time Traffic

Algorithms | Greatest Common Divisors | ISSAC 2001 | Mathematics | Trigonometric Polynomials |

claim paper

» On the detection of singularities of a periodic function

» Nonequispaced Hyperbolic Cross Fast Fourier Transform

» Fast algorithms for Iterative Adaptive Approach spectral estimation techniques

» Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials

» Stability Results for Random Sampling of Sparse Trigonometric Polynomials

» Tensorproduct monotonicity preservation

» Formal Verification of Floating Point Trigonometric Functions

» FloatingPoint Trigonometric Functions for FPGAs

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	ISSAC
Authors	Jamie Mulholland, Michael B. Monagan

Comments (0)

Sciweavers

Algorithms for trigonometric polynomials

Algorithms | Greatest Common Divisors | ISSAC 2001 | Mathematics | Trigonometric Polynomials |

Explore & Download

Productivity Tools

Sciweavers