Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++

DOI10.1007/978-3-642-30023-3_30zbMATH Open1251.65038OpenAlexW2270326309MaRDI QIDQ2913150FDOQ2913150

Rami M. Younis, Hamdi A. Tchelepi

Publication date: 26 September 2012

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30023-3_30

Recommendations

• Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
• Exploiting sparsity in automatic differentiation on multicore architectures
• Compact sparse symbolic Jacobian computation in large systems of ODEs
• scientific article; zbMATH DE number 1222410
• scientific article; zbMATH DE number 992819

zbMATH Keywords

simulationsparsityautomatic differentiationimplicit partial differential-algebraic equationJacobian evaluation

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Uses Software

• ADIFOR
• ADIC
• ColPack

This page was built for publication: Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++

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