We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 06c57d1 commit 837abaeCopy full SHA for 837abae
1 file changed
src/algebra/fft.md
@@ -88,7 +88,7 @@ If we can compute the $\text{DFT}(A)$ in linear time using $\text{DFT}(A_0)$ and
88
89
Let's learn how we can accomplish that.
90
91
-Suppose we have computed the vectors $\left(y_k^0\right)\_{k=0}^{n/2-1} = \text{DFT}(A_0)$ and $\left(y_k^1\right)\_{k=0}^{n/2-1} = \text{DFT}(A_1)$.
+Suppose we have computed the vectors $\left(y_k^0\right)_{k=0}^{n/2-1} = \text{DFT}(A_0)$ and $\left(y_k^1\right)_{k=0}^{n/2-1} = \text{DFT}(A_1)$.
92
Let us find a expression for $\left(y_k\right)_{k=0}^{n-1} = \text{DFT}(A)$.
93
94
For the first $\frac{n}{2}$ values we can just use the previously noted equation $A(x) = A_0(x^2) + x A_1(x^2)$:
0 commit comments