Abstract
This chapter discusses the iterative methods to solve the system of linear equations Ax = b where ∈n) for very large values of n. One of the simplest iterative methods is that of Jacobi. This chapter also explains the Gauss–Seidel iteration method and the fundamental theorem of linear iterative methods. A modification of the Gauss–Seidel iteration is known as successive overrelaxation. The introduction of the parameter ω into the Gauss–Seidel iteration is done to enhance the rate of convergence. The chapter also presents the fundamental theorem of linear iterative methods, regular splitting theorem, and diagonal dominance theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
