A New GSOR Method for Generalised Saddle Point Problems

A New GSOR Method for Generalised Saddle Point Problems

Year:    2016

East Asian Journal on Applied Mathematics, Vol. 6 (2016), Iss. 1 : pp. 23–41

Abstract

A novel generalised successive overrelaxation (GSOR) method for solving generalised saddle point problems is proposed, based on splitting the coefficient matrix. The proposed method is shown to converge under suitable restrictions on the iteration parameters, and we present some illustrative numerical results.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/eajam.150515.251015a

East Asian Journal on Applied Mathematics, Vol. 6 (2016), Iss. 1 : pp. 23–41

Published online:    2016-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    19

Keywords:    Generalised saddle point problem generalised successive overrelaxation method splitting convergence analysis.

  1. The Uzawa-PPS iteration methods for nonsingular and singular non-Hermitian saddle point problems

    Li, Cheng-Liang | Ma, Chang-Feng

    Computers & Mathematics with Applications, Vol. 75 (2018), Iss. 2 P.703

    https://doi.org/10.1016/j.camwa.2017.10.003 [Citations: 5]
  2. On QSOR-Like Iteration Method for Quaternion Saddle Point Problems

    Zhang, Yanting | Liu, Gunagmei | Yao, Yiwen | Huang, Jingpin

    2023 International Conference on Algorithms, Computing and Data Processing (ACDP), (2023), P.157

    https://doi.org/10.1109/ACDP59959.2023.00032 [Citations: 0]