/explore
|
You are here 
|
vcansimplify.wordpress.com | ||
| | | | |
jakevdp.github.io
[AI summary] A tutorial demonstrates how to numerically simulate and animate the time-dependent Schrodinger equation for a quantum particle tunneling through a barrier using Python. |
|
| | | | | ||
| | | | |
connorboyle.io
I'm planning to write a series of posts about fast Fourier transform algorithms. This first post covers the Cooley-Tukey algorithm, which is the original and most well-known FFT algorithm. |
|
| | | | | ||
| | | | |
www.jeremykun.com
In our last primer we saw the Fourier series, which flushed out the notion that a periodic function can be represented as an infinite series of sines and cosines. While this is fine and dandy, and quite a powerful tool, it does not suffice for the real world. In the real world, very little is truly periodic, especially since human measurements can only record a finite period of time. Even things we wish to explore on this blog are hardly periodic (for instance, image analysis). |
|
| | | | | ||
| | | | |
www.jeremykun.com
The singular value decomposition (SVD) of a matrix is a fundamental tool in computer science, data analysis, and statistics. It's used for all kinds of applications from regression to prediction, to finding approximate solutions to optimization problems. In this series of two posts we'll motivate, define, compute, and use the singular value decomposition to analyze some data. (Jump to the second post) I want to spend the first post entirely on motivation and background. |
|
| | | |||
