An efficient iterative method for solving large linear systems

Document Type : Research Paper

Authors

1 Department of Computer Science, University of Guilan, P.O.Box 41335-19141, Rasht,Iran

2 Department of Applied Mathematics and Department of Computer Science, University of Guilan, P.O.Box 41335-19141, Rasht, Iran Center of Excellence for Mathematical Modelling, Optimization and Combinational Computing (MMOCC), University of Guilan, P.O.Box 41938-19141, Rasht, Iran.

Abstract

This paper presents a new powerful iterative method for solving large and sparse linear systems. Using the idea of the
Jaya 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

References

[1] W. E. Arnoldi, The principle of minimized interations in the solution of the matrix eigenvalue problem, Quarterly of applied mathematics, 9 (1) (1951) 17-29.
[2] P. G. Ciarlet, Introduction to Numerical Linear Algebra and Optimisation, Cambridge Texts in Applied Mathematics, Cambridge University Press, Cambridge, (1989).
[3] I. S. Du , R. G. Grimes and J. G. Lewis, User's guide for the Harwell{Boeing sparse matrix collection (Release I), Technical Report TR/PA/92/86, CERFACS, Toulouse, France (1992).
[4] W. Ford, Numerical Linear Algebra with Applications, Academic Press, USA, (2015).
[5] L. Hogben, Handbook of linear algebra, Chapman & Hall/CRC, New York, USA, (2007).
[6] R. B. Morgan, A restarted GMRES method augmented with eigenvectors, SIAM Journal on Matrix Analysis and Applications, 16 (4) (1995) 1154-1171.
[7] R. Rao, Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems, International Journal of Industrial Engineering Computations, 7 (1) (2016) 19-34.
[8] R. V. Rao, Jaya: an advanced optimization algorithm and its engineering applications, Cham: SpringerInternational Publishing, (2019).
[9] Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear algebra and its applications, 34 (1980) 269-295.
[10] Y. Saad, Krylov subspace methods for solving large unsymmetric linear systems, Mathematics of computation, 37 (155) (1981) 105-126.
[11] Y. Saad, Iteractive Method for Sparse Linear Systems, PWS Publishing Company, a division of International Thomson Publishing Inc., USA, (1996).
[12] Y. Saad, Schultz, Martin, H. GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on scientific and statistical computing, 7 (1986) 856-869.
[13] L. N. Trefethen and D. Bau, Numerical Linear Algebra, SIAM, (1997).
[14] D. S.Watkins, Fundamentals of Matrix Computations, third ed.,Wiley, Hoboken, NJ, (2010).
[15] H. Wendland, Numerical Linear Algebra, Cambridge Texts in Applied Mathematics. Cambridge University Press, (2018).
Journal of Hyperstructures
Volume 9, Issue 1
June 2020
Pages 62-74

Files

Share

How to cite

Statistics