Author Archives: mg50

Fast Fourier Transform Assume we have $n$ data points $x_0,x_1,\dots ,x_{n-1}$. For convenience, assume $n$ is a power of two; if it’s different, we can just pad with zeroes. We want to efficiently compute the transformed sequence $y_k … Continue reading →

So suppose we have a set of points $(x_1,y_1),\dots ,(x_n,y_n)$ and we want to find ${\beta }_0$, ${\beta }_1$ such that $y_i={\beta }_1{x}_i+{\beta }_0$ for each $i$, or in matrix notation $Y=X\overline{\beta }$, where … Continue reading →