Block Gauss elimination followed by a classical iterative method for the solution of linear systems

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In the last two decades many papers have appeared in which the application of an iterative method for the solution of a linear system is preceded by a step of the Gauss elimination process in the hope that this will increase the rates of convergence of the iterative method. This combination of methods has been proven successful especially when the matrix A of the system is an M-matrix. The purpose of this paper is to extend the idea of one to more Gauss elimination steps, consider other classes of matrices A, e.g., p-cyclic consistently ordered, and generalize and improve the asymptotic convergence rates of some of the methods known so far. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Alanelli, M., & Hadjidimos, A. (2004). Block Gauss elimination followed by a classical iterative method for the solution of linear systems. Journal of Computational and Applied Mathematics, 163(2), 381–400. https://doi.org/10.1016/j.cam.2003.08.045

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free