LU decomposition; Cholesky decomposition; JOR; SOR; Steepest Descent; Conjugate gradient. All these methods where used to aproximate a solution to a linear system Ax = b, where A is the Hilbert Matrix and b is a vector of all ones.
-
Notifications
You must be signed in to change notification settings - Fork 0
LU decomposition; Cholesky decomposition; JOR; SOR; Steepest Descent; Conjugate gradient. All these methods where used to aproximate a solution to a linear system Ax = b, where A is the Hilbert Matrix and b is a vector of all ones.
uzzui/Numerical-Analysis-I---Iterative-Methods
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
LU decomposition; Cholesky decomposition; JOR; SOR; Steepest Descent; Conjugate gradient. All these methods where used to aproximate a solution to a linear system Ax = b, where A is the Hilbert Matrix and b is a vector of all ones.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published