Skip to main content

Comparison of Operating Modes

  • Chapter
Discrete Iterations

Part of the book series: Springer Series in Computational Mathematics ((SSCM,volume 6))

  • 251 Accesses

Abstract

In the preceding chapter we were able to establish results on the behaviour of discrete iterations using the vector distance d as well as the (rather strong) notion of boolean contraction. These results were essentially transplanted from the context of continuous iterations into the discrete context. Under the assumption of contraction we were also able to make some comparisons between different operating modes (“More sequential implies more contracting”).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Robert, F. (1986). Comparison of Operating Modes. In: Discrete Iterations. Springer Series in Computational Mathematics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61607-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-61607-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64882-3

  • Online ISBN: 978-3-642-61607-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics