Skip to main content
SpringerLink
Log in

Fast Inclusion of Interval Matrix Multiplication

  • Published:
Reliable Computing

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, New York, 1983.

    Google Scholar 

  2. Dongarra, J. J., Croz, J. D., Duff, I. S., and Hammarling, S.: Algorithm 679: A Set of Level 3 Basic Linear Algebra Subprograms, ACMTrans. Math. Softw. 16 (1990), pp. 1–17.

    Article  Google Scholar 

  3. Golub, G. H. and Van Loan, C. F.: Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore and London, 1996.

    Google Scholar 

  4. Kulisch, U. W. and Miranker, W. L.: The Arithmetic of the Digital Computer: A New Approach, SIAM Review 28 (1986), pp. 1–40.

    Article  Google Scholar 

  5. Oishi, S.: Fast Enclosure of Matrix Eigenvalues and Singular Values via Rounding Mode Controlled Computation, Linear Alg. Appl. 324 (2001), pp. 133–146.

    Article  Google Scholar 

  6. Oishi, S. and Rump, S. M.: Fast Verification of Solutions of Matrix Equations, Numer. Math. 90 (4)(2002), pp. 755–773.

    Article  Google Scholar 

  7. Rump, S. M.: Computational Error Bounds for Multiple or Nearly Multiple Eigenvalues, Linear Alg. Appl. 324 (2001), pp. 209–226.

    Article  Google Scholar 

  8. Rump, S. M.: Fast and Parallel Interval Arithmetic, BIT 39 (3)(1999), pp. 534–554.

    Article  Google Scholar 

  9. Rump, S. M.: INTLAB—INTerval LABoratory, Version 4.1.1, 2003, http://www.ti3.tu-harburg.de/~rump/intlab/

  10. Rump, S. M.: On the Solution of Interval Linear Systems, Computing 47 (1992), pp. 337–353.

    Google Scholar 

  11. Whaley, R. C., Petitet, A., and Dongarra, J. J.: Automated Empirical Optimization of Software and the ATLAS Project, Parallel Comput. 27 (1–2)(2001), pp. 3–25.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Science and Engineering, Waseda University, Tokyo, 169-8555, Japan

    Takeshi Ogita

  2. Department of Computer Science, School of Science and Engineering, Waseda University, Tokyo, 169-8555, Japan

    Shin’ichi Oishi

Authors
  1. Takeshi Ogita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin’ichi Oishi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Takeshi Ogita.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ogita, T., Oishi, S. Fast Inclusion of Interval Matrix Multiplication. Reliable Comput 11, 191–205 (2005). https://doi.org/10.1007/s11155-005-3615-2

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11155-005-3615-2

Keywords

Search

Navigation