TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME

DOI10.1142/S0129053304000219zbMath1076.65068OpenAlexW1995666079MaRDI QIDQ5692260

H. Martin Bücker, Christian H. Bischof, Po-Ting Wu

Publication date: 27 September 2005

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129053304000219

zbMATH Keywords

numerical examplesshallow water equationsleapfrog schemeparallel computationdifference schemeAutomatic differentiationcombination of forward and reverse modes

Mathematics Subject Classification ID

Nonlinear boundary value problems for ordinary differential equations (34B15) Parallel numerical computation (65Y05) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Numerical differentiation (65D25) Finite difference and finite volume methods for ordinary differential equations (65L12)

Uses Software

• ADOL-C
• GRESS
• revolve
• ADIFOR
• ADIC
• MINPACK-2
• TAMC
• TAF
• Odyssee

Cites Work

• Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme
• A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products
• Recipes for adjoint code construction
• Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
• Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
• Computing Gradients in Large-Scale Optimization Using Automatic Differentiation
• Algorithm 755: ADOL-C
• Algorithm 799: revolve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item