Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
On the Realistic Performance of Linear Algebra Components in Iterative Solvers Read chapter Read first chapter

1999 | OriginalPaper | Chapter

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

Authors : A. Walther, A. Griewank

Published in: High Performance Scientific and Engineering Computing

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

previous chapter On the Realistic Performance of Linear Algebra Components in Iterative Solvers
next chapter Adaptive Grids for Time Dependent Conservation Laws: Theory and Applications in CFD
Metadata
Title
Applying the Checkpointing Routine treeverse to Discretizations of Burgers’ Equation*
Authors
A. Walther
A. Griewank
Copyright Year
1999
Publisher
Springer Berlin Heidelberg
Book
High Performance Scientific and Engineering Computing

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

Electronic ISBN: 978-3-642-60155-2

Copyright Year: 1999

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

Premium Partner

    Image Credits