A new version of KSOR method with lower number of iterations and lower spectral radius


In this paper, we propose a new method for solving linear algebraic systems based on the KSOR method. The new approach introduces a new coefficient in the assumed updated section from the KSOR method. It obtains the same solution as KSOR for a given linear algebraic system, but in order to get this, we have to modify the diagonal of the coefficient matrix of the initial system. The new method reaches the solution in fewer steps than KSOR on certain examples, but we have an additional step for the modification mentioned above with O(m) complexity, while a normal step of iteration has \(O(m^2)\) complexity, so overall our method has better performances than KSOR method. Furthermore, on certain examples, the spectral radius of the iteration matrix of the new method is strictly less than the one of KSOR and MKSOR methods.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9


  1. Meng G-Y (2014) A practical asymptotical optimal sor method. Appl Math Comput 242:707–715. https://doi.org/10.1016/j.amc.2014.06.034

    MathSciNet  Article  MATH  Google Scholar 

  2. Zheng Q, Ma C (2014) A new sor-like method for the saddle point problems. Appl Math Comput 233:421–429. https://doi.org/10.1016/j.amc.2014.02.011

    MathSciNet  Article  MATH  Google Scholar 

  3. Youssef IK, Taha AA (2013) On the modified successive overrelaxation method. Appl Math Comput 219:4601–4613. https://doi.org/10.1016/j.amc.2012.10.071

    MathSciNet  Article  MATH  Google Scholar 

  4. Youssef IK (2012) On the successive overrelaxation method. J Math Stat 8:176–184. https://doi.org/10.3844/jmssp.2012.176.184

    Article  Google Scholar 

  5. Young DM (1971) Iterative solution for large linear systems, 1st edn. Academic Press, New York

    Google Scholar 

Download references


This study was funded by the Sectoral Operational Programme Human Resources Development 2007-2013 of the Ministry of European Funds through the Financial Agreement POSDRU/159/1.5/S/134398. The research presented in this paper is also supported by the following projects: NETIO - ForestMon (53/05.09.2016, cod SMIS2014+ 105976), SPERO (PN-III-P2-2.1-SOL-2016-03-0046, 3Sol/2017) and ROBIN (PN-III-P1-1.2-PCCDI-2017-0734).

Author information



Corresponding author

Correspondence to P. G. Popescu.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Communicated by V. Loia.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Constantinescu, R., Poenaru, R.C., Pop, F. et al. A new version of KSOR method with lower number of iterations and lower spectral radius. Soft Comput 23, 11729–11736 (2019). https://doi.org/10.1007/s00500-018-03725-2

Download citation


  • Linear algebraic systems
  • Iterative methods
  • Iteration matrices
  • Spectral radius