NANAJun 9, 2009

A Generalization of the 2D-DSPM for Solving Linear System of Equations

arXiv:0906.17981 citations
Originality Synthesis-oriented
AI Analysis

For researchers in numerical linear algebra, this is an incremental improvement to an existing iterative solver.

The authors generalize the 2D-DSPM iterative method for solving linear systems, proving convergence and showing through numerical experiments that it outperforms the original 2D-DSPM.

In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced. In this paper, we improve this method and give a generalization of it. Convergence properties of this kind of generalization are also discussed. We finally give some numerical experiments to show the efficiency of the method and compare with 2D-DSPM.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes