Fast verified solutions of sparse linear systems with H-matrices

A. Minamihata, K. Sekine, T. Ogita, S. Oishi

研究成果: Article

1 引用 (Scopus)

抜粋

This paper is concerned with the problem of verifying the accuracy of an approximate solution of a sparse linear system whose coefficient matrix is an H-matrix. Fast and efficient methods of calculating componentwise error bounds of the computed solution are proposed. The methods are based on the verified criterion for an M-matrix. The main point of this article is that the proposed methods can be applied with any iterative solution methods such as the Gauss-Seidel method and Krylov subspace methods. Therefore, the sparsity of the coefficient matrix is preserved in the verification process. Numerical results are presented, illustrating the performance of the proposed methods.

元の言語English
ページ(範囲)127-141
ページ数15
ジャーナルReliable Computing
19
発行部数2
出版物ステータスPublished - 2013 12 1

    フィンガープリント

ASJC Scopus subject areas

  • Software
  • Computational Mathematics
  • Applied Mathematics

これを引用

Minamihata, A., Sekine, K., Ogita, T., & Oishi, S. (2013). Fast verified solutions of sparse linear systems with H-matrices. Reliable Computing, 19(2), 127-141.