From 2a243ff8fe7daefbb4163364082533a1ced476d4 Mon Sep 17 00:00:00 2001 From: Alexis Montoison Date: Fri, 11 Oct 2024 00:09:16 -0500 Subject: [PATCH] Fix a typo in matrix_free.md --- docs/src/matrix_free.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/src/matrix_free.md b/docs/src/matrix_free.md index d1dab89ff..0709f13b2 100644 --- a/docs/src/matrix_free.md +++ b/docs/src/matrix_free.md @@ -166,7 +166,7 @@ For a function $u(x)$ discretized on a periodic grid with $n$ points, the FFT of \hat{u}_k = \sum_{j=0}^{n-1} u_j e^{-i k x_j}, ``` -where $\hat{u}_k$ represents the Fourier coefficients for the frequency $k$, and $u_j$ is the value of $u$ at the grid point $x_j$ defined as $x_j = \frec{2 \pi j}{L} with period $L$. +where $\hat{u}_k$ represents the Fourier coefficients for the frequency $k$, and $u_j$ is the value of $u$ at the grid point $x_j$ defined as $x_j = \frac{2 \pi j}{L} with period $L$. The inverse FFT (IFFT) reconstructs $u$ from its Fourier coefficients: ```math