vault backup: 2026-10-04 22:01:21
This commit is contained in:
1 parent
b059ec8932
commit
f2f69b73ef
4 files changed
+6850
-6801
No files matched your search
@@ -12,7 +12,7 @@
|
||||
a_{11} & a_{12} & a_{13} & b_{1} \\ a_{21} & a_{22} & a_{23} & b_{2} \\ a_{31} & a_{32} & a_{33} & b_{3}
|
||||
\end{bmatrix} \end{gathered}$$
|
||||
- Same elementary operations can be used with augmented matrices, now it is with rows instead of equations.
|
||||
- gaussian elimination
|
||||
- Gaussian Elimination
|
||||
- this is converting a matrix to **echelon form** (or row echelon form)
|
||||
- this is when every leading term is a column to the left of the one below it and any zero rows are at the bottom
|
||||
- once the augmented matrix is in echelon form it can be converted back into a linear system of equations (that is not in echelon form) and solved
|
||||
@@ -26,5 +26,5 @@
|
||||
- Homogeneous linear system
|
||||
- when the $b_{n}$ term of each equation is zero
|
||||
- There is a "trivial solution" where each variable equals zero
|
||||
- There can also be nowingspann-trivial solutions
|
||||
- There can also be non-trivial solutions
|
||||
-
|
||||
Reference in new issue
Block a user