Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Pull request for solution of L06 Q4 - fixed simple display bug in LaTeX display of one equation #11

Merged
merged 1 commit into from
Sep 23, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
35 changes: 17 additions & 18 deletions lectures/L04_scipy.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -3043,24 +3043,23 @@
"source": [
"A convolution is defined as: \n",
"\n",
" \\begin{equation} \n",
" (f \\star g)(t) \\equiv \\int_{-\\infty}^{\\infty} f(\\tau) g(t - \\tau) d\\tau \n",
" \\end{equation} \n",
"\n",
" It is easy to compute this with FFTs, via the _convolution theorem_, \n",
" \\begin{equation} \n",
" \\mathcal{F}\\{f \\star g\\} = \\mathcal{F}\\{f\\} \\, \\mathcal{F}\\{g\\} \n",
" \\end{equation} \n",
" That is: the Fourier transform of the convolution of $f$ and $g$ is simply\n",
" the product of the individual transforms of $f$ and $g$. This allows us\n",
" to compute the convolution via multiplication in Fourier space and then take\n",
" the inverse transform, $\\mathcal{F}^{-1}\\{\\}$, to recover the convolution in real space:\n",
" \n",
" \\begin{equation}\n",
" f \\star g = \\mathcal{F}^{-1}\\{ \\mathcal{F}\\{f\\} \\, \\mathcal{F}\\{g\\}\\}\n",
" \\end{equation}\n",
" \n",
"A common use of a convolution is to smooth noisy data, for example by convolving noisy data with a Gaussian. We'll do that here."
"\\begin{equation} \n",
" (f \\star g)(t) \\equiv \\int_{-\\infty}^{\\infty} f(\\tau) g(t - \\tau) d\\tau \\tag{1} \n",
"\\end{equation} \n",
"\n",
"It is easy to compute this with FFTs, via the _convolution theorem_, \n",
"\n",
"\\begin{equation} \n",
" \\mathcal{F}\\{f \\star g\\} = \\mathcal{F}\\{f\\} \\, \\mathcal{F}\\{g\\} \\tag{2} \n",
"\\end{equation} \n",
"\n",
"That is: the Fourier transform of the convolution of $f$ and $g$ is simply the product of the individual transforms of $f$ and $g$. This allows us to compute the convolution via multiplication in Fourier space and then take the inverse transform, $\\mathcal{F}^{-1}\\{\\}$, to recover the convolution in real space:\n",
"\n",
"\\begin{equation} \n",
" f \\star g = \\mathcal{F}^{-1}\\{ \\mathcal{F}\\{f\\} \\, \\mathcal{F}\\{g\\}\\} \\tag{3} \n",
"\\end{equation} \n",
"\n",
"A common use of a convolution is to smooth noisy data, for example by convolving noisy data with a Gaussian. We'll do that here.\n"
]
},
{
Expand Down