A block triangular preconditioner for a class of three-by-three block saddle point problems

01/27/2022
by   Hamed Aslani, et al.
0

This paper deals with solving a class of three-by-three block saddle point problems. The systems are solved by preconditioning techniques. Based on an iterative method, we construct a block upper triangular preconditioner. The convergence of the presented method is studied in details. Finally, some numerical experiments are given to demonstrate the superiority of the proposed preconditioner over some existing ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/23/2020

On the preconditioning of three-by-three block saddle point problems

We establish a new iterative method for solving a class of large and spa...
research
09/23/2021

A new block diagonal preconditioner for a class of 3× 3 block saddle point problems

We study the performance of a new block preconditioner for a class of 3×...
research
08/18/2021

Schur complement based preconditioners for twofold and block tridiagonal saddle point problems

In this paper, two types of Schur complement based preconditioners are s...
research
05/01/2020

A shift-splitting preconditioner for asymmetric saddle point problems

In this paper, we execute the shift-splitting preconditioner for asymmet...
research
06/08/2023

A Class of Smoothing Modulus-Based Iterative Method for Solving Implicit Complementarity Problems

In this paper, a class of smoothing modulus-based iterative method was p...
research
08/16/2022

On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems

We consider the generalized successive overrelaxation (GSOR) method for ...
research
11/20/2022

Restarted Nonnegativity Preserving Tensor Splitting Methods via Relaxed Anderson Acceleration for Solving Multi-linear Systems

Multilinear systems play an important role in scientific calculations of...

Please sign up or login with your details

Forgot password? Click here to reset