A Block Diagonal Preconditioner for Generalised Saddle Point Problems

A Block Diagonal Preconditioner for Generalised Saddle Point Problems

Year:    2016

East Asian Journal on Applied Mathematics, Vol. 6 (2016), Iss. 3 : pp. 235–252

Abstract

A lopsided alternating direction iteration (LADI) method and an induced block diagonal preconditioner for solving block two-by-two generalised saddle point problems are presented. The convergence of the LADI method is analysed, and the block diagonal preconditioner can accelerate the convergence rates of Krylov subspace iteration methods such as GMRES. Our new preconditioned method only requires a solver for two linear equation sub-systems with symmetric and positive definite coefficient matrices. Numerical experiments show that the GMRES with the new preconditioner is quite effective.

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.260815.280216a

East Asian Journal on Applied Mathematics, Vol. 6 (2016), Iss. 3 : pp. 235–252

Published online:    2016-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    18

Keywords:    Generalised saddle point problem Krylov subspace methods alternating direction iteration preconditioning convergence.