524 research outputs found
Efficient Compilation of a Class of Variational Forms
We investigate the compilation of general multilinear variational forms over
affines simplices and prove a representation theorem for the representation of
the element tensor (element stiffness matrix) as the contraction of a constant
reference tensor and a geometry tensor that accounts for geometry and variable
coefficients. Based on this representation theorem, we design an algorithm for
efficient pretabulation of the reference tensor. The new algorithm has been
implemented in the FEniCS Form Compiler (FFC) and improves on a previous
loop-based implementation by several orders of magnitude, thus shortening
compile-times and development cycles for users of FFC.Comment: ACM Transactions on Mathematical Software 33(3), 20 pages (2007
Principles and Implementation of Deductive Parsing
We present a system for generating parsers based directly on the metaphor of
parsing as deduction. Parsing algorithms can be represented directly as
deduction systems, and a single deduction engine can interpret such deduction
systems so as to implement the corresponding parser. The method generalizes
easily to parsers for augmented phrase structure formalisms, such as
definite-clause grammars and other logic grammar formalisms, and has been used
for rapid prototyping of parsing algorithms for a variety of formalisms
including variants of tree-adjoining grammars, categorial grammars, and
lexicalized context-free grammars.Comment: 69 pages, includes full Prolog cod
Compiling a domain specific language for dynamic programming
Steffen P. Compiling a domain specific language for dynamic programming. Bielefeld (Germany): Bielefeld University; 2006
- …