Skip to main content

Recursive address calculation

  • Chapter
Handbook for Automatic Computation

Part of the book series: Die Grundlehren der mathematischen Wissenschaften ((GL,volume 137))

  • 278 Accesses

Abstract

Recursive address calculation concerns optimization of the calculation of the addresses of subscripted variables ocurring in the statement following do, which we call the do statement.

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

Editor information

F. L. Bauer A. S. Householder F. W. J. Olver H. Rutishauser K. Samelson E. Stiefel

Rights and permissions

Reprints and permissions

Copyright information

© 1967 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Grau, A.A., Hill, U., Langmaack, H. (1967). Recursive address calculation. In: Bauer, F.L., Householder, A.S., Olver, F.W.J., Rutishauser, H., Samelson, K., Stiefel, E. (eds) Handbook for Automatic Computation. Die Grundlehren der mathematischen Wissenschaften, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-86937-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-86937-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-86939-6

  • Online ISBN: 978-3-642-86937-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics