gibson:teaching:fall-2016:math753:gaussian-elimination

This shows you the differences between two versions of the page.

— |
gibson:teaching:fall-2016:math753:gaussian-elimination [2016/10/06 09:56] (current) gibson created |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | ====== Math 753/853 Gaussian elimination ====== | ||

+ | Gaussian elimination is an algorithm for solving $Ax=b$ problems, that is, systems of linear equations. | ||

+ | Gaussian elimination is very commonly introduced in introductory textbooks on algebra and differential equations, and many of you probably have experience using it to solve small systems of equations by hand on paper. | ||

+ | |||

+ | However, this is a very old-fashioned viewpoint. Nowadays, instead of doing Gausian elimination on paper, we do LU decomposition on a computer (the two are closely related). In this course we review Gaussian elimination only as a pathway towards understanding the LU decomposition. | ||

+ | |||

+ | Some online resources on Gaussian elimination | ||

+ | * [[https://en.wikipedia.org/wiki/Gaussian_elimination|Wikipedia]]. Examples, history, applications, efficiency, pseudocode. | ||

+ | * [[http://mathworld.wolfram.com/GaussianElimination.html|Wolfram Alpha]]. Quite a nice explanation with a concrete example. |

gibson/teaching/fall-2016/math753/gaussian-elimination.txt ยท Last modified: 2016/10/06 09:56 by gibson