13.07.2015 Views

UFL Specification and User Manual 0.3 - FEniCS Project

UFL Specification and User Manual 0.3 - FEniCS Project

UFL Specification and User Manual 0.3 - FEniCS Project

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>UFL</strong> <strong>Specification</strong> <strong>and</strong> <strong>User</strong> <strong>Manual</strong> <strong>0.3</strong>Martin S. Alnæs, Anders Logg5.3.1 Forward modeTODO: forward ad.py5.3.2 Reverse modeTODO: reverse ad.py5.3.3 Mixed derivativesTODO: ad.py5.4 Computational graphsThis section is for form compiler developers <strong>and</strong> is probably of no interest toend-users.An expression tree can be seen as a directed acyclic graph (DAG). To aidin the implementation of form compilers, <strong>UFL</strong> includes tools to build a linearized1 computational graph from the abstract expression tree.A graph can be partitioned into subgraphs based on dependencies of subexpressions,such that a quadrature based compiler can easily place subexpressionsinside the right sets of loops.5.4.1 The computational graphTODO: finish graph.py1 Linearized as in a linear datastructure, do not confuse this with automatic differentiation.88

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!