Skip to content

Commit dd1c1c9

Browse files
Tom's second edit of a quantecon lecture, July 21
1 parent 996aeb6 commit dd1c1c9

File tree

1 file changed

+8
-4
lines changed

1 file changed

+8
-4
lines changed

lectures/svd_intro.md

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -901,6 +901,8 @@ where $ r < p $.
901901
902902
Next, we describe alternative representations of our first-order linear dynamic system.
903903
904+
**Guide to three representations:** In practice, we'll be interested in Representation 3. We present the first 2 in order to set the stage for some intermediate steps that might help us understand what is under the hood of Representation 3. In applications, we'll use only a small subset of the DMD to approximate dynamics. To to that, we'll want to be using the reduced SVD's affiliated with representation 3, not the full SVD's affiliated with Representations 1 and 2.
905+
904906
+++
905907
906908
## Representation 1
@@ -1135,7 +1137,7 @@ To verify this, first note that, because $ \tilde U^T \tilde U = I$, it follows
11351137
11361138
$$
11371139
\tilde A = \tilde U^T \hat A \tilde U = \tilde U^T X' \tilde V \tilde \Sigma^{-1} \tilde U^T \tilde U
1138-
= \tilde U^T X' \tilde V \tilde \Sigma^{-1}
1140+
= \tilde U^T X' \tilde V \tilde \Sigma^{-1} \tilde U^T
11391141
$$ (eq:tildeAverify)
11401142
11411143
@@ -1144,8 +1146,8 @@ Next, we'll just compute the regression coefficients in a projection of $\hat A
11441146
standard least-square formula
11451147
11461148
$$
1147-
(\tilde U^T \tilde U)^{-1} \tilde U^T \hat A = (\tilde U^T \tilde U)^{-1} \tilde U^T X' \tilde V \tilde \Sigma^{1} =
1148-
\tilde U^T X' \tilde V \tilde \Sigma^{-1} = \tilde A .
1149+
(\tilde U^T \tilde U)^{-1} \tilde U^T \hat A = (\tilde U^T \tilde U)^{-1} \tilde U^T X' \tilde V \tilde \Sigma^{-1} \tilde U^T =
1150+
\tilde U^T X' \tilde V \tilde \Sigma^{-1} \tilde U^T = \tilde A .
11491151
$$
11501152
11511153
@@ -1430,7 +1432,9 @@ We can then use $\check X_{t+j}$ or $\hat X_{t+j}$ to forecast $X_{t+j}$.
14301432
14311433
14321434
1433-
## Using Fewer Modes
1435+
### Using Fewer Modes
1436+
1437+
In applications, we'll actually want to just a few modes, often three or less.
14341438
14351439
Some of the preceding formulas assume that we have retained all $p$ modes associated with the positive
14361440
singular values of $X$.

0 commit comments

Comments
 (0)