COMPARISON OF ITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS

Authors

  • Tshering Denka Science and Humanities Department, College of Science and Technology, Royal University of Bhutan
  • Dechen Lhamo Science and Humanities Department, College of Science and Technology, Royal University of Bhutan

Keywords:

Linear Systems, Sparse Matrices, Sherman-Morrison, Steepest Descent, Conjugate Gradient, Conjugate Directions, GMRES, Arnoldi iteration.

Abstract

This paper presents comparison of iterative methods for sparse linear systems containing large sparse systems. While direct methods are more in use and are error free, they are often expensive and time consuming. A comparison of some options such as the popular steepest-descent and conjugate gradient method are presented. Other methods such as the Arnoldi iteration are also given.

Downloads

Published

2018-12-15

How to Cite

Denka, T., & Lhamo, D. (2018). COMPARISON OF ITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS. Zorig Melong- A Technical Journal of Science, Engineering and Technology, 4(1), 1–39. Retrieved from https://journal.cst.edu.bt/index.php/zm/article/view/16

Issue

Vol. 4 No. 1 (2018): Volume 4 Issue 1

Section

Research Article

License

Copyright (c) 2018 Zorig Melong- A Technical Journal

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

All articles published in Zorig Melong are registered under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. unless otherwise mentioned. The journal allows unrestricted use of articles in any medium, reproduction, and distribution by providing adequate credit to the authors and the source of publication.