Skip to content

LU decomposition typo & suggestion #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Aug 4, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file modified semester1/linalg/linalg.pdf
Binary file not shown.
4 changes: 2 additions & 2 deletions semester1/linalg/linalg.typ
Original file line number Diff line number Diff line change
Expand Up @@ -175,7 +175,7 @@ Basically $A x = b$.

== LU Decomposition

Run REF on $A in RR^(m times n)$ to generate $L in RR^(m times n)$ and track coefficients in $U in RR^(n times n)$.
Run REF on $A in RR^(m times n)$ to generate $U in RR^(m times n)$ and track coefficients in $L in RR^(n times n)$, where $L$ contains $1$'s on the diagonal and the opposite values of the operations performed on the corresponding rows.

== Permutation Matrices

Expand Down Expand Up @@ -518,4 +518,4 @@ Any matrix $A$ can be factored as $A = U Sigma V^T$.
- $A^T A = U Lambda_1 U^T$. Here we have that $Lambda_1 = Sigma^T Sigma$. $Sigma = "diag"(sigma_1, ..., sigma_k) "s.t." k = min(n,m)$
- $A A^T = V Lambda_2 V^T$. Here we have that $Lambda_2 = Sigma Sigma^T$. $Sigma = "diag"(sigma_1, ..., sigma_k) "s.t." k = min(n,m)$
- $sigma_i = sqrt(lambda_i)$.
- For both: $Sigma$ is constructed s.t. $sigma_1 >= ... >= sigma_k >= 0$. Rank: number of non-zero singular values.
- For both: $Sigma$ is constructed s.t. $sigma_1 >= ... >= sigma_k >= 0$. Rank: number of non-zero singular values.