data-analysis

⯅ Category index

Non-diffusive atmospheric flow #15: Wrap-up


Non-diffusive atmospheric flow #14: Markov matrix calculations


Non-diffusive atmospheric flow #13: Markov matrix examples


Non-diffusive atmospheric flow #12: dynamics warm-up


Non-diffusive atmospheric flow #11: flow pattern visualisations


Non-diffusive atmospheric flow #10: significance of flow patterns


Non-diffusive atmospheric flow #9: speeding up KDE


Non-diffusive atmospheric flow #8: flow pattern distribution


Non-diffusive atmospheric flow #7: PCA for spatio-temporal data


Non-diffusive atmospheric flow #6: principal components analysis


Non-diffusive atmospheric flow #5: pre-processing


Non-diffusive atmospheric flow #4: exploring Z500


Non-diffusive atmospheric flow #3: reanalysis data and Z500


Non-diffusive atmospheric flow #2: outline & plan


Haskell data analysis: Reading NetCDF files


Haskell FFT 15: Some small Haskell things


Haskell FFT 14: Wrap-up


Haskell FFT 13: Optimisation Part 3


Haskell FFT 12: Optimisation Part 2


Haskell FFT 11: Optimisation Part 1


Haskell FFT 10: Building a package


Haskell FFT 9: Prime-Length FFT With Rader’s Algorithm


Haskell FFT 8: Benchmarking Experiments


Haskell FFT 7: Where We’ve Got To, Where We’re Going


Haskell FFT 6: Implementing the Mixed-Radix FFT


Haskell FFT 5: Transforming Vectors of Arbitrary Lengths


Haskell FFT 4: A Simple Application


Haskell FFT 3: Cooley-Tukey for Powers of Two


Haskell FFT 2: Matrix factorisation


Haskell FFT 1: The Discrete Fourier Transform


Data Analysis in Haskell