One of the most common digital-signal-processing techniques is the discreteFouriertransform (DFT), which breaks a signal into its component frequencies and can be represented as a matrix.
What follows is a case study of an actual application - a discreteFouriertransform (DFT) - showing the performance improvements that result when compiling with various compiler options.