Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6891970 | Computers & Mathematics with Applications | 2018 | 11 Pages |
Abstract
In this paper, we introduce a two-stage method to solve rectangular linear systems that exhibits faster convergence than typical stationary iterative methods. Under suitable conditions, we prove convergence of the new method. The number of outer iterations can be reduced by using a few significant number of inner iterations for efficient computations. Further, we perform a comparison analysis, and establish that a higher number of inner iterations ensures a smaller spectral radius of the global iteration matrix. We also discuss the uniqueness of a proper splitting, and illustrate different comparison theorems for different subclasses of proper splittings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Nachiketa Mishra, Debasisha Mishra,