Taylor or Fourier applications in computer science

Question

I'm an undergrad computer science student. As part of my calculus course I need to write a 'paper' (of course not as serious as a PhD paper) telling about a cool (for me) application of taylor/fourier series in software development or general computer science.

The only rule is 'not PI approximation'.

Any good ideas, I've made a research in EBSCO, ACM library and even IEEE but I can't find something useful to me.

Best regards!

Answer 1

Here are some ideas:

• The Schönhage-Strassen fast multiplication algorithm is based on FFT.
• Media compression methods are based on variants of FFT. For example, JPEG is based on a two-dimensional version of a variant of FFT known as DCT.
• In general, FFT is a basic tool in digital signal processing. It's use for example in speech recognition to extract the formants.
• Algorithms for computing transcendental functions are sometimes based on Padé approximants, which are a generalization of Taylor series.
• Algorithms used in CAS to calculate the asymptotics of general expressions use Taylor series.