Applications of Mathematics

, Volume 62, Issue 6, pp 537–559 | Cite as

Preconditioning of two-by-two block matrix systems with square matrix blocks, with applications



Two-by-two block matrices of special form with square matrix blocks arise in important applications, such as in optimal control of partial differential equations and in high order time integration methods.

Two solution methods involving very efficient preconditioned matrices, one based on a Schur complement reduction of the given system and one based on a transformation matrix with a perturbation of one of the given matrix blocks are presented. The first method involves an additional inner solution with the pivot matrix block but gives a very tight condition number bound when applied for a time integration method. The second method does not involve this matrix block but only inner solutions with a linear combination of the pivot block and the off-diagonal matrix blocks.

Both the methods give small condition number bounds that hold uniformly in all parameters involved in the problem, i.e. are fully robust. The paper presents shorter proofs, extended and new results compared to earlier publications.


preconditioning Schur complement transformation optimal control implicit time integration 

MSC 2010



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    O. Axelsson: On the efficiency of a class of A-stable methods. BIT, Nord. Tidskr. Inf.-behandl. 14 (1974), 279–287.MathSciNetMATHGoogle Scholar
  2. [2]
    O. Axelsson, R. Blaheta, R. Kohut: Preconditioning methods for high-order strongly stable time integration methods with an application for a DAE problem. Numer. Linear Algebra Appl. 22 (2015), 930–949.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    O. Axelsson, S. Farouq, M. Neytcheva: Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems. Poisson and convectiondiffusion control. Numer. Algorithms 73 (2016), 631–663.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    O. Axelsson, S. Farouq, M. Neytcheva: Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems. Stokes control. Numer. Algorithms 74 (2017), 19–37.MathSciNetCrossRefMATHGoogle Scholar
  5. [5]
    O. Axelsson, A. Kucherov: Real valued iterative methods for solving complex symmetric linear systems. Numer. Linear Algebra Appl. 7 (2000), 197–218.MathSciNetCrossRefMATHGoogle Scholar
  6. [6]
    O. Axelsson, M. Neytcheva, B. Ahmad: A comparison of iterative methods to solve complex valued linear algebraic systems. Numer. Algorithms 66 (2014), 811–841.MathSciNetCrossRefMATHGoogle Scholar
  7. [7]
    O. Axelsson, P. S. Vassilevski: A black box generalized conjugate gradient solver with inner iterations and variable-step preconditioning. SIAM J. Matrix Anal. Appl. 12 (1991), 625–644.MathSciNetCrossRefMATHGoogle Scholar
  8. [8]
    Z.-Z. Bai: On preconditioned iteration methods for complex linear systems. J. Eng. Math. 93 (2015), 41–60.MathSciNetCrossRefMATHGoogle Scholar
  9. [9]
    Z.-Z. Bai, M. Benzi, F. Chen, Z.-Q. Wang: Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems. IMA J. Numer. Anal. 33 (2013), 343–369.MathSciNetCrossRefMATHGoogle Scholar
  10. [10]
    Z.-Z. Bai, F. Chen, Z.-Q. Wang: Additive block diagonal preconditioning for block twoby-two linear systems of skew-Hamiltonian coefficient matrices. Numer. Algorithms 62 (2013), 655–675.MathSciNetCrossRefMATHGoogle Scholar
  11. [11]
    F. Brezzi, M. Fortin: Mixed and Hybrid Finite Element Methods. Springer Series in Computational Mathematics 15, Springer, New York, 1991.Google Scholar
  12. [12]
    J. C. Butcher: Numerical Methods for Ordinary Differential Equations, John Wiley & Sons, Chichester, 2008.CrossRefMATHGoogle Scholar
  13. [13]
    J. Cahouet, J.-P. Chabard: Some fast 3D finite element solvers for the generalized Stokes problem. Int. J. Numer. Methods Fluids 8 (1988), 869–895.CrossRefMATHGoogle Scholar
  14. [14]
    A. Greenbaum, V. Pták, Z. Strakoš: Any nonincreasing convergence curve is possible for GMRES. SIAM J. Matrix Anal. Appl. 17 (1996), 465–469.MathSciNetCrossRefMATHGoogle Scholar
  15. [15]
    J. L. Lions: Some Aspects of the Optimal Control of Distributed Parameter Systems. CBMS-NSF Regional Conference Series in Applied Mathematics 6, Society for Industrial and Applied Mathematics, Philadelphia, 1972.Google Scholar
  16. [16]
    C. C. Paige, M. A. Saunders: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12 (1975), 617–629.MathSciNetCrossRefMATHGoogle Scholar
  17. [17]
    Y. Saad: A flexible inner-outer preconditioned GMRES-algorithm. SIAM J. Sci. Comp. 14 (1993), 461–469.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Institute of Mathematics of the Academy of Sciences of the Czech Republic, Praha, Czech Republic 2017

Authors and Affiliations

  1. 1.Institute of Geonics of the Czech Academy of SciencesOstravaCzech Republic

Personalised recommendations