Abstract
The C++ class fdtd uses automatic differentiation techniques to implement an abstract time stepping scheme in an object-oriented fashion, making it possible to use the resulting simulator to solve inverse or control problems. The class takes a complete specification of a single step of the scheme, and assembles from it a complete simulator, along with the linearized and adjoint simulations. The result is a (nonlinear) operator in the sense of the Hilbert Class Library, a C++ package for optimization. Performance is equivalent to that of optimized Fortran implementations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gockenbach, M.S., Reynolds, D.R., Symes, W.W. (2002). Automatic Differentiation and the Adjoint State Method. In: Corliss, G., Faure, C., Griewank, A., Hascoët, L., Naumann, U. (eds) Automatic Differentiation of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0075-5_18
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0075-5_18
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6543-6
Online ISBN: 978-1-4613-0075-5
eBook Packages: Springer Book Archive