Abstract
Large sparse linear systems of equations occur frequently in engineering mathematics, and are usually solved by an iterative method such as successive over‐relaxation. One of the principal advantages of iterative methods is that the zeros of the system matrix are not destroyed. This property can be used to substantially reduce both computer storage requirements and the number of arithmetic operations. Most standard texts, however, do not emphasize this point. In this paper, a simple compact method of storing the system matrix is described, which substantially reduces storage requirements and improves the efficiency of the computation by eliminating most multiplications by zero.
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 callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: 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.
