MN-PGSOR method for solving nonlinear systems with block two-by-two complex symmetric Jacobian matrices (Q2052080)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7433541
Language Label Description Also known as
default for all languages
No label defined
    English
    MN-PGSOR method for solving nonlinear systems with block two-by-two complex symmetric Jacobian matrices
    scientific article; zbMATH DE number 7433541

      Statements

      MN-PGSOR method for solving nonlinear systems with block two-by-two complex symmetric Jacobian matrices (English)
      0 references
      0 references
      0 references
      25 November 2021
      0 references
      Summary: For solving the large sparse linear systems with \(2\times2\) 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.
      0 references
      0 references
      0 references
      0 references

      Identifiers