An efficient iterative method for solving large linear systems

This paper presents a new powerful iterative method for solving large and sparse linear systems. Using the idea of theJaya method to the restarted generalized minimum residual (GMRES) method, we propose the Jaya-GMRES method.The JayaGMRES is an efficient solver, being based mainly on matrix-vector multiplications. Numerical results show that the Jaya-GMRES method has found more accurate solutions and converges much regular than the GMRES method.

Keywords:

GMRES method , Jaya optimization algorithm , Linear systems , Iterative method , Non-symmetric matrix

Authors

Ali Jamalian

Department of Computer Science, University of Guilan, P.O.Box ۴۱۳۳۵-۱۹۱۴۱, Rasht,Iran

Hossein Aminikhah

Department of Applied Mathematics and Department of Computer Science, University of Guilan, P.O.Box ۴۱۳۳۵-۱۹۱۴۱, Rasht, Iran Center of Excellence for Mathematical Modelling, Optimization and Combinational Computing (MMOCC), University of Guilan,

Certificate
من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

https://civilica.com/doc/1902767

شناسه ملی سند علمی:

JR_JHSMS-9-1_006

تاریخ نمایه سازی: 16 بهمن 1402

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:

Jamalian, Ali and Aminikhah, Hossein,1399,An efficient iterative method for solving large linear systems,https://civilica.com/doc/1902767

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of University of Guilan

Type of center: دانشگاه دولتی

Paper count: 18,848

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.