Skip to content

Commit 98f5bef

Browse files
Tom's Jan 15 yesterday edits of svd lecture
1 parent 26f9491 commit 98f5bef

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

lectures/svd_intro.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1589,7 +1589,7 @@ is an $m \times n$ matrix of least squares projections of $X$ on $\Phi$.
15891589
15901590
15911591
1592-
By virtue of least-squares projection theory discussed in this quantecon lecture e <https://python-advanced.quantecon.org/orth_proj.html>, we can represent $X$ as the sum of the projection $\check X$ of $X$ on $\Phi$ plus a matrix of errors.
1592+
By virtue of least-squares projection theory discussed in this quantecon lecture <https://python-advanced.quantecon.org/orth_proj.html>, we can represent $X$ as the sum of the projection $\check X$ of $X$ on $\Phi$ plus a matrix of errors.
15931593
15941594
15951595
To verify this, note that the least squares projection $\check X$ is related to $X$ by
@@ -1726,7 +1726,7 @@ We can then use $\check X_{t+j}$ or $\hat X_{t+j}$ to forecast $X_{t+j}$.
17261726
17271727
### Using Fewer Modes
17281728
1729-
In applications, we'll actually want to just a few modes, often three or less.
1729+
In applications, we'll actually want to use just a few modes, often three or less.
17301730
17311731
Some of the preceding formulas assume that we have retained all $p$ modes associated with the positive
17321732
singular values of $X$.

0 commit comments

Comments
 (0)