Affiliation:
1. School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia
Abstract
In this paper, algorithms for different types of trigonometric power sums are developed and presented. Although interesting in their own right, these trigonometric power sums arise during the creation of an algorithm for the four types of twisted trigonometric power sums defined in the introduction. The primary aim in evaluating these sums is to obtain exact results in a rational form, as opposed to standard or direct evaluation, which often results in machine-dependent decimal values that can be affected by round-off errors. Moreover, since the variable, m, appearing in the denominators of the arguments of the trigonometric functions in these sums, can remain algebraic in the algorithms/codes, one can also obtain polynomial solutions in powers of m and the variable r that appears in the cosine factor accompanying the trigonometric power. The degrees of these polynomials are found to be dependent upon v, the value of the trigonometric power in the sum, which must always be specified.
Reference26 articles.
1. Problem E1937;Quoniam;Am. Math. Mon.,1966
2. A trigonometric summation—Solution to Problem E1937;Greening;Am. Math. Mon.,1968
3. Sum of inverse powers of cosines;Gardner;Siam Rev.,1969
4. Sum of inverse powers of cosines (L.A. Gardner, Jr.);Fisher;Siam Rev.,1971
5. Klamkin, M.S. (1990). Problems in Applied Mathematics—Selections from SIAM Review, SIAM.