Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme

DOI10.1023/A:1021858217693zbMath1031.90075OpenAlexW1807735843MaRDI QIDQ1868394

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

Publication date: 27 April 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021858217693

zbMATH Keywords

Jacobianleapfrog schemeautomatic differentiationsparsity

Mathematics Subject Classification ID

Mathematical programming (90C99)

Related Items (1)

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

Uses Software

• ADIFOR
• ADIC

This page was built for publication: Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme