Skip to content

A very basic Machine-Learning Algorithm, involving the Monte-Carlo-Method to find the Fourier-Series Approximation of a given Signal

Notifications You must be signed in to change notification settings

jbirkenmaier/Fourier-Analysis-Using-Monte-Carlo-Method

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 

Repository files navigation

Fourier-Analysis

A very basic algorithm, involving the Monte-Carlo-Method to find the Fourier-Series Approximation of a given Signal.

The following image shows the result of the approximation of a sine wave (red). The longer the runtime of the algorithm, the better the approximation. The label of the blue line shows the error associated with the output, which is connected to the area difference between the two lines. The algorithm aims to reduce this area by randomly varying the parameters of a Fourier-Series. If the result is minimizing the area, it will be accepted, otherwise it will be discarded. This idea is called "Monte-Carlo-Method" and has wide applications in Science. The runtime associated with these kinds of algorithms can be huge. Even though approximating the sine wave with a Fourier-Series is a trivial example, the algorithm can be applied to any given signal. WhatsApp Bild 2024-10-29 um 14 25 17_3c9f5b7f

fourier_compressed.mp4

About

A very basic Machine-Learning Algorithm, involving the Monte-Carlo-Method to find the Fourier-Series Approximation of a given Signal

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages