Printed Page 634
634
The sine function is used in many scientific applications, so a calculator/computer must be able to evaluate it with lightning-fast speed.
While we know how to find the exact value of the sine function for many numbers, such as 0, π6,π2, and so on, we have no methodology for finding the exact value of sin3 (which should be close to sinπ) or sin1.5 (which should be close to sinπ2). Since the sine function can be evaluated at any real number, we first use some of its properties to restrict its domain to something more manageable.
The answers to Problems 3 and 8 reveal why Maclaurin series or Taylor series are not used to approximate the value of most functions. But often the methods used are similar. For example, a Chebyshev polynomial approximation to the sine function on the interval [−π2,π2] still has the form of a Maclaurin series, but it was designed to converge more uniformly than the Maclaurin series, so that it can be expected to give answers near π2 that are roughly as accurate as those near zero.
Chebyshev polynomials are commonly found in mathematical libraries for calculators/computers. For example, the widely used Gnu Compiler Collection* uses Chebyshev polynomials to evaluate trigonometric functions. The Chebyshev polynomial approximation of degree 7 for the sine function is S7(x)=0.9999966013x−0.1666482357x3+0.008306286146x5−0.1836274858×10−3x7
635
∗For more information on the Gnu Compiler Collection (GCC), go to https://www.gnu.org/software/gcc/
The Chebyshev polynomials are designed to remain close to a function across an entire closed interval. They seek to keep the approximation within a specified distance of the function being approximated at every point of that interval. If Sn is a Chebyshev approximation of degree n to the sine function on [−π2,π2], then the error estimate in using Sn(x) is given by max
Like most error estimates of this type, it gives an upper bound to the error.