MN-PGSOR Method for Solving Nonlinear Systems with Block Two-by-Two Complex Symmetric Jacobian Matrices

Yu-Ye Feng, Qing-Biao Wu and Kenan Yildirim

Journal of Mathematics, 2021, vol. 2021, 1-18

Abstract: For solving the large sparse linear systems with 2×2 block structure, the generalized successive overrelaxation (GSOR) iteration method is an efficient iteration method. Based on the GSOR method, the PGSOR method introduces a preconditioned matrix with a new parameter for the coefficient matrix which can enhance the efficiency. To solve the nonlinear systems in which the Jacobian matrices are complex and symmetric with the block two-by-two form, we try to use the PGSOR method as an inner iteration, with the help of the modified Newton method as an efficient outer iteration method. This new method is called the modified Newton-PGSOR (MN-PGSOR) method. Local convergence properties of the MN-PGSOR are analyzed under the Hölder condition. Finally, we give the comparison of our new method with some previous methods in the numerical results. The MN-PGSOR method is superior in both iteration steps and computing time.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/4393353.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/4393353.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:4393353

DOI: 10.1155/2021/4393353

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().