Skip to main content

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 84))

  • 127 Accesses

Abstract

In this chapter we present some simple algorithms, governed by memoryless regulators. While these procedures are of actual interest also in their own right, they serve in the present context also to give some preliminary ideas in what form may converge constraints be formulated. One may get, in this way, more insight into how the notions and constraints, introduced in Chapter 3, are motivated.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

© 1975 Springer-Verlag Wien

About this chapter

Cite this chapter

Csibi, S. (1975). Some Iteration Rules without Memory. In: Stochastic Processes with Learning Properties. International Centre for Mechanical Sciences, vol 84. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3006-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-3006-3_2

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81337-9

  • Online ISBN: 978-3-7091-3006-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics