|Authors||M. S. Alnæs|
|Title||The Unified Form Language|
|Afilliation||Scientific Computing, Center for Biomedical Computing (SFF), Scientific Computing|
|Project(s)||Center for Biomedical Computing (SFF)|
|Publication Type||Talks, contributed|
|Year of Publication||2009|
|Location of Talk||Presentation at the FEniCS'09 Workshop|
The Unified Form Language (UFL) is a domain specific language for declaration of discrete variational forms. In terms of the FEniCS vision Automation of Computational Mathematical Modeling, UFL improves upon Automation of Discretization, and adds Automation of Linearization. UFL provides a new and unified input language for the form compilers FFC and SFC. The main design goals for this project has been language expressiveness, automatic differentiation, and compiler efficiency. The language should be more expressive than previous form languages, encompassing the input capabilities of both FFC and SFC. Automatic Differentiation should be incorporated as a natural part of the language, which is useful for, but not limited to, linearization of nonlinear PDEs. Form compiler efficiency should be improved for complex equations that were previously problematic to compile. All design goals have been met, and UFL is currently being incorporated in FFC, SFC and PyDOLFIN. UFL will fully replace old form languages in the next official FEniCS release. In this talk, I will give a quick overview of the language features, with focus on the new features UFL brings to FEniCS.