Algorithms for trigonometric polynomials

DOI10.1145/384101.384135MaRDI QIDQ2958941zbMATH OpenOpenAlexFDO

Authors Jamie Thomas Mulholland, Michael Monagan

Publication date 3 February 2017

Published in Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/384101.384135

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Trigonometric polynomials with simple roots
• On the sign of a trigonometric expression
• Algorithms for trigonometric curves (simplification, implicitization, parameterization)
• On generalized trigonometric functions and series of rational functions
• Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition

Cited in

(10)

• A canonical simplifier for trigonometric expressions in the kinematic equation
• Trigonometric polynomials with simple roots
• Algorithms for trigonometric curves (simplification, implicitization, parameterization)
• A Bairstow's type method for trigonometric polynomials
• The natural algorithmic approach of mixed trigonometric-polynomial problems
• Fast evaluation of trigonometric polynomials from hyperbolic crosses
• An elementary algorithm to evaluate trigonometric functions to high precision
• Exact Expressions for Trigonometric Functions
• Square-free factorization of mixed trigonometric-polynomials
• Properties and construction of NCP functions

This page was built for publication: Algorithms for trigonometric polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958941)