Skip to main content
SpringerLink
Log in

Applying the Checkpointing Routine treeverse to Discretizations of Burgers’ Equation*

  • Conference paper
High Performance Scientific and Engineering Computing

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 8))

Abstract

We consider the inviscid Burgers’ equation augmented by a control term and its adjoint equation. For several discretization schemes of the inviscid Burgers’ equation the adjoint finite difference methods are derived. Applying these discretization methods and the checkpointing routine treeverse, approximations of the solution of both differential equations are calculated and compared.

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

Access this chapter

Log in via an institution
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.

References

  1. Eberhard, P., Bischof, C.: Automatic differentiation of numerical integration algorithms. Preprint ANL/MCS-P621-1196, Argonne Nat. Laboratory, 1996

    Google Scholar 

  2. Griewank, A.: Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Opt. Methods and Software 1, 1992, 35-54

    Article  Google Scholar 

  3. Griewank, A.: On automatic differentiation. In Mathematical Programming: Recent Developments and Applications, M. Iri and K. Tanabe, eds., Kluwer Academic Publishers, Amsterdam, 1989, 83–108

    Google Scholar 

  4. Griewank, A., Walther A.: Treeverse: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation. Preprint IOKOMO-04-1997, Technische Universitat Dresden, 1997, (submitted)

    Google Scholar 

  5. Iri, M.: History of automatic differentiation and rounding error estimation. In Automatic Differentiation of Algorithms: Theory, Implementation, and Application, A. Griewank and G. Corliss, eds., SIAM (1992) 1-16.

    Google Scholar 

  6. LeVeque, R.: Numerical Methods for Conservation Laws. Birkhauser Verlag, Basel, 1992

    Book  Google Scholar 

  7. Hirsch, C.: Numerical Computation of Internal and External Flows. Wiley &; Sons, Chichester, 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Scientific Computing, Technical University Dresden, 01062, Dresden, Germany

    A. Walther & A. Griewank

Authors
  1. A. Walther
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Griewank
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, D-80290, München, Germany

    Hans-Joachim Bungartz

  2. Lehrstuhl für Strömungsmechanik, Friedrich-Alexander-Universität Erlangen-Nürnberg, Cauerstraße 4, D-91058, Erlangen, Germany

    Franz Durst

  3. Institut für Informatik, Technische Universität München, D-80290, München, Germany

    Christoph Zenger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walther, A., Griewank, A. (1999). Applying the Checkpointing Routine treeverse to Discretizations of Burgers’ Equation*. In: Bungartz, HJ., Durst, F., Zenger, C. (eds) High Performance Scientific and Engineering Computing. Lecture Notes in Computational Science and Engineering, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60155-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60155-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65730-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation