Comparisons between Jacobi method, Gauss Seidel method and Successive Over Relaxation method / Wan Nashratudiniah Wan Hamad
In numerical analysis there is a system of linear equations which is form from just a set of two or more linear equations. Iterative methods formally produce the solution of a linear system after an infinite number of steps. Iterative methods can be competitive with direct methods as it provided the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/77819/1/77819.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In numerical analysis there is a system of linear equations which is form from just a set of two or more linear equations. Iterative methods formally produce the solution of a linear system after an infinite number of steps. Iterative methods can be competitive with direct methods as it provided the number of iteration that are require to converge either independent of n or scale or scales sub linearly with respect to n.
For instances of large sparse matrices, direct methods may be disadvantageous due to the sudden replacement, although exceptionally competent direct solution can be come up with sparse matrices recommending special differential equation. Iterative methods are made achievable by preconditioning techniques that will be address in this project. The iterative methods that will be evaluated in this project are Jacobian method, Gauss Seidel method and Successive Over Relaxation method. |
|---|