Sparse Jacobian computation in automatic differentiation by static program analysis

DOI10.1007/3-540-49727-7_19MaRDI QIDQ4217933zbMATH OpenFDO

Authors Mohamed Tadjouddine, Frédéric Eyssette, Cédric Faure

Publication date 4 May 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49727-7_19

zbMATH Keywords

automatic differentiationnumerical examplessparse Jacobian computationsparse matrices

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Recommendations

• Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
• scientific article; zbMATH DE number 992819
• Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
• Computing a sparse Jacobian matrix by rows and columns
• Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process

Cited in

(2)

• Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++
• Performance issues for vertex elimination methods in computing Jacobians using automatic differentiation

Describes a project that uses

Uses Software

• ADIC
• Odyssee
• TAMC

This page was built for publication: Sparse Jacobian computation in automatic differentiation by static program analysis

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