Abstract
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.
Metadata
Item Type: | Thesis (Degree) |
---|---|
Creators: | Creators Email / ID Num. Wan Hamad, Wan Nashratudiniah 2017669308 |
Contributors: | Contribution Name Email / ID Num. Thesis advisor Zull Pakkal, Norhaslinda UNSPECIFIED |
Subjects: | Q Science > QA Mathematics > Analysis Q Science > QA Mathematics > Analysis > Analytical methods used in the solution of physical problems Q Science > QA Mathematics > Instruments and machines Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms |
Divisions: | Universiti Teknologi MARA, Terengganu > Kuala Terengganu Campus > Faculty of Computer and Mathematical Sciences |
Programme: | Bachelor of Science (Hons) Computational Mathematics |
Keywords: | Numerical Analysis ; Linear System ; Jacobi Method ; Gauss Seidel Method ; Successive Over Relaxation Method |
Date: | January 2021 |
URI: | https://ir.uitm.edu.my/id/eprint/77819 |
Download
77819.pdf
Download (75kB)