Skip to main content

Parallel interval methods for perturbed linear systems

  • Conference paper
  • First Online:
Parallel Scientific Computing (PARA 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 879))

Included in the following conference series:

  • 160 Accesses

Abstract

The constants defining a system of linear equations may be subject to incertainties. In this case the induced variations of the solution can be effectively bounded by methods of interval analysis. In the worst case the complexity of this problem is exponential in the number of variables. We consider Rohn's sign-accord algorithm to solve the problem. A parallel version of the method is developed using rounded interval arithmetic. Theoretical considerations as well as numerical tests indicate that the parallelling is efficient (i.e. the speedup is near linear) if an appropriate number of parallel processors is allocated. This number can be estimated before the start of the parallel process.

The present paper is an extended abstract. The full paper is available in [4].

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S.G. (1982). The Design and Analysis of Parallel Algorithms. Prentice Hall.

    Google Scholar 

  2. Baumann, M. (1983). Řesení Soustav Intervalových Lineárích Rovnic. Master's Thesis. Charles University, Prague.

    Google Scholar 

  3. Henriksen, T. & Toft, O. (1992). C++ Interval, Matrix, and Interval Matrix Libraries. Report NI-92-08, Institute for Numerical Analysis, The Technical University of Denmark.

    Google Scholar 

  4. Madsen, K. & Toft, O. (1994). A Parallel Method for Linear Interval Equations. To appear in Interval Computations.

    Google Scholar 

  5. Neumaier, A. (1990). Interval Methods for Systems of Equations. Cambridge University Press.

    Google Scholar 

  6. Oettli, W. & Prager, W. (1964). Compatibility of Approximate Solution of Linear Equations with Given Error Bounds for Coefficients and Right-hand sides. Numer. Math. 6:405–409.

    Google Scholar 

  7. Rohn, J. (1989). Systems of Linear Interval Equations. Linear Algebra Appl., 126:39–78.

    Google Scholar 

  8. Toft, O. (1992). Sequential and Parallel Solution of Linear Interval Equations. Master's Thesis. Institute for Numerical Analysis, The Technical University of Denmark.

    Google Scholar 

  9. Vorst, H.A. and Dooren, P., eds. (1990). Parallel Algorithms for Numerical Linear Algebra. North Holland, Amsterdam.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jack Dongarra Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madsen, K., Toft, O. (1994). Parallel interval methods for perturbed linear systems. In: Dongarra, J., Waśniewski, J. (eds) Parallel Scientific Computing. PARA 1994. Lecture Notes in Computer Science, vol 879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030164

Download citation

  • DOI: https://doi.org/10.1007/BFb0030164

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58712-5

  • Online ISBN: 978-3-540-49050-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics