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

DOI10.1142/S0129053304000219MaRDI QIDQ5692260zbMATH OpenOpenAlexFDO

Authors Christian H. Bischof, H. Martin Bücker, 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

Automatic differentiationcombination of forward and reverse modesdifference schemeleapfrog schemenumerical examplesparallel computationshallow water equations

Mathematics Subject Classification ID

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

Recommendations

• Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme
• On the discrete adjoints of adaptive time stepping algorithms
• A continuous-stage modified leap-frog scheme for high-dimensional semi-linear Hamiltonian wave equations
• On leapfrog-Chebyshev schemes
• \texttt{PETSc TSAdjoint}: a discrete adjoint ODE solver for first-order and second-order sensitivity analysis

Cites work

• A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products
• Algorithm 755: ADOL-C
• Algorithm 799: revolve
• Computational differentiation: techniques, applications, and tools
• Computing Gradients in Large-Scale Optimization Using Automatic Differentiation
• Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
• Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
• Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme
• Hierarchical approaches to automatic differentiation
• scientific article; zbMATH DE number 992814 (Why is no real title available?)
• scientific article; zbMATH DE number 992820 (Why is no real title available?)
• scientific article; zbMATH DE number 854122 (Why is no real title available?)
• scientific article; zbMATH DE number 1456803 (Why is no real title available?)
• Recipes for adjoint code construction

Cited in

(1)

• Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme

Describes a project that uses

Uses Software

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

This page was built for publication: TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692260)