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

TL;DR
This paper generalizes and improves the 2D-DSPM iterative method for solving linear systems, analyzing its convergence and demonstrating its efficiency through numerical experiments.
Contribution
It introduces a generalized version of the 2D-DSPM method and discusses its convergence properties, enhancing the original approach.
Findings
The generalized method converges under certain conditions.
Numerical experiments show improved efficiency over the original 2D-DSPM.
The method is effective for solving linear systems.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Iterative Methods for Nonlinear Equations · Electromagnetic Scattering and Analysis
