Fast verified solutions of sparse linear systems with H-matrices

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

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)127-141
    Number of pages15
    JournalReliable Computing
    Volume19
    Issue number2
    Publication statusPublished - 2013

    Fingerprint

    Sparse Linear Systems
    H-matrix
    Linear systems
    Gauss-Seidel Method
    Krylov Subspace Methods
    M-matrix
    Iterative Solution
    Coefficient
    Sparsity
    Error Bounds
    Approximate Solution
    Numerical Results

    Keywords

    • H-matrix
    • Sparse linear systems
    • Verified numerical computations

    ASJC Scopus subject areas

    • Software
    • Applied Mathematics
    • Computational Mathematics

    Cite this

    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.

    Fast verified solutions of sparse linear systems with H-matrices. / Minamihata, A.; Sekine, K.; Ogita, T.; Oishi, Shinichi.

    In: Reliable Computing, Vol. 19, No. 2, 2013, p. 127-141.

    Research output: Contribution to journalArticle

    Minamihata, A, Sekine, K, Ogita, T & Oishi, S 2013, 'Fast verified solutions of sparse linear systems with H-matrices', Reliable Computing, vol. 19, no. 2, pp. 127-141.
    Minamihata, A. ; Sekine, K. ; Ogita, T. ; Oishi, Shinichi. / Fast verified solutions of sparse linear systems with H-matrices. In: Reliable Computing. 2013 ; Vol. 19, No. 2. pp. 127-141.
    @article{b327ce6529d646ca9d1410c87780df83,
    title = "Fast verified solutions of sparse linear systems with H-matrices",
    abstract = "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.",
    keywords = "H-matrix, Sparse linear systems, Verified numerical computations",
    author = "A. Minamihata and K. Sekine and T. Ogita and Shinichi Oishi",
    year = "2013",
    language = "English",
    volume = "19",
    pages = "127--141",
    journal = "Reliable Computing",
    issn = "1385-3139",
    publisher = "Springer Netherlands",
    number = "2",

    }

    TY - JOUR

    T1 - Fast verified solutions of sparse linear systems with H-matrices

    AU - Minamihata, A.

    AU - Sekine, K.

    AU - Ogita, T.

    AU - Oishi, Shinichi

    PY - 2013

    Y1 - 2013

    N2 - 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.

    AB - 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.

    KW - H-matrix

    KW - Sparse linear systems

    KW - Verified numerical computations

    UR - http://www.scopus.com/inward/record.url?scp=84891351591&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84891351591&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:84891351591

    VL - 19

    SP - 127

    EP - 141

    JO - Reliable Computing

    JF - Reliable Computing

    SN - 1385-3139

    IS - 2

    ER -