Skip to main content
Log in

A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

A fast numerical verification method is proposed for evaluating the accuracy of numerical solutions for symmetric saddle point linear systems whose diagonal blocks of the coefficient matrix are semidefinite matrices. The method is based on results of an algebraic analysis of a block diagonal preconditioning. Some numerical experiments are present to illustrate the usefulness of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Axelsson, O., Neytcheva, M.: Eigenvalue estimates for preconditioned saddle point matrices. Numer. Linear Algebra Appl. 13, 339–360 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numerica. 14, 1–137 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Braess, D.: Finite elements: Theory, fast solvers and applications in solid mechanics. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  4. Chen, X., Hashimoto, K.: Numerical validation of solutions of saddle point matrix equations. Numer. Linear Algebra Appl. 10, 661–672 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kimura, T., Chen, X.: Validated solutions of saddle point linear systems. SIAM J. Matrix Anal. Appl. 30(4), 1697–1708 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Minamihata, A., Sekine, K., Ogita, T., Rump, S.M., Oishi, S.: Improved error bounds for linear systems with H-matrices. NOLTA IEICE 6(3), 377–382 (2015)

    Article  Google Scholar 

  7. Oishi, S., Rump, S.M.: Fast verification of solutions of matrix equations. Numer. Math. 90(4), 755–773 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Rump, S.M.: INTLAB–INTerval LABoratory. In: Csendes, T. (ed.) Developments in Reliable Computing. pp. 77–104. Kluwer Academic Publishers, Dordrecht (1999). http://www.ti3.tu-harburg.de/rump/intlab/

  9. Rump, S.M.: Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse. BIT Numer. Math. 51(2), 367–384 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rump, S.M.: Accurate solution of dense linear systems, Part II: algorithms using directed rounding. J. Comput. Appl. Math. (JCAM) 242, 185–212 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Vassilevski, P.S., Villa, U.: A mixed formulation for the Brinkman problem. SIAM J. Numer. Anal. 52(1), 258–281 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takuma Kimura.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kobayashi, R., Kimura, T. & Oishi, S. A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems. Numer Algor 76, 33–51 (2017). https://doi.org/10.1007/s11075-016-0240-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-016-0240-6

Keywords

Navigation