Fast inclusion of interval matrix multiplication

Takeshi Ogita, Shinichi Oishi

    Research output: Contribution to journalArticle

    6 Citations (Scopus)

    Abstract

    This paper is concerned with interval matrix multiplication.New algorithms are proposed to calculate an inclusion of the product of interval matrices using rounding mode controlled computation. Thecomputational cost of the proposed algorithms is almost the same as that for calculating an inclusion of the product of point matrices.Numerical results are presented to illustrate that the new algorithms are much faster than the conventional algorithms and that the guaranteed accuracies obtained by the proposed algorithms are comparable to those of the conventional algorithms.

    Original languageEnglish
    Pages (from-to)191-205
    Number of pages15
    JournalReliable Computing
    Volume11
    Issue number3
    DOIs
    Publication statusPublished - 2005 Jun

    Fingerprint

    Interval Matrix
    Matrix multiplication
    Inclusion
    Rounding
    Calculate
    Numerical Results
    Costs

    ASJC Scopus subject areas

    • Software
    • Safety, Risk, Reliability and Quality

    Cite this

    Fast inclusion of interval matrix multiplication. / Ogita, Takeshi; Oishi, Shinichi.

    In: Reliable Computing, Vol. 11, No. 3, 06.2005, p. 191-205.

    Research output: Contribution to journalArticle

    Ogita, Takeshi ; Oishi, Shinichi. / Fast inclusion of interval matrix multiplication. In: Reliable Computing. 2005 ; Vol. 11, No. 3. pp. 191-205.
    @article{2ed49db61cb64b3aa188361dba2903f3,
    title = "Fast inclusion of interval matrix multiplication",
    abstract = "This paper is concerned with interval matrix multiplication.New algorithms are proposed to calculate an inclusion of the product of interval matrices using rounding mode controlled computation. Thecomputational cost of the proposed algorithms is almost the same as that for calculating an inclusion of the product of point matrices.Numerical results are presented to illustrate that the new algorithms are much faster than the conventional algorithms and that the guaranteed accuracies obtained by the proposed algorithms are comparable to those of the conventional algorithms.",
    author = "Takeshi Ogita and Shinichi Oishi",
    year = "2005",
    month = "6",
    doi = "10.1007/s11155-005-3615-2",
    language = "English",
    volume = "11",
    pages = "191--205",
    journal = "Reliable Computing",
    issn = "1385-3139",
    publisher = "Springer Netherlands",
    number = "3",

    }

    TY - JOUR

    T1 - Fast inclusion of interval matrix multiplication

    AU - Ogita, Takeshi

    AU - Oishi, Shinichi

    PY - 2005/6

    Y1 - 2005/6

    N2 - This paper is concerned with interval matrix multiplication.New algorithms are proposed to calculate an inclusion of the product of interval matrices using rounding mode controlled computation. Thecomputational cost of the proposed algorithms is almost the same as that for calculating an inclusion of the product of point matrices.Numerical results are presented to illustrate that the new algorithms are much faster than the conventional algorithms and that the guaranteed accuracies obtained by the proposed algorithms are comparable to those of the conventional algorithms.

    AB - This paper is concerned with interval matrix multiplication.New algorithms are proposed to calculate an inclusion of the product of interval matrices using rounding mode controlled computation. Thecomputational cost of the proposed algorithms is almost the same as that for calculating an inclusion of the product of point matrices.Numerical results are presented to illustrate that the new algorithms are much faster than the conventional algorithms and that the guaranteed accuracies obtained by the proposed algorithms are comparable to those of the conventional algorithms.

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

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

    U2 - 10.1007/s11155-005-3615-2

    DO - 10.1007/s11155-005-3615-2

    M3 - Article

    VL - 11

    SP - 191

    EP - 205

    JO - Reliable Computing

    JF - Reliable Computing

    SN - 1385-3139

    IS - 3

    ER -