Show simple item record

dc.contributor.authorOelgaard, Kristian B
dc.contributor.authorWells, G N
dc.date.accessioned2009-02-26T17:20:58Z
dc.date.available2009-02-26T17:20:58Z
dc.date.issued2009-02-26T17:20:58Z
dc.identifier.urihttp://www.dspace.cam.ac.uk/handle/1810/214789
dc.description.abstractWe examine aspects of the computation of finite element matrices and vectors which are made possible by automated code generation. Given a variational form in a syntax which resembles standard mathematical notation, the low-level computer code for building finite element tensors, typically matrices, vectors and scalars, can be generated automatically via a form compiler. In particular, the generation of code for computing finite element matrices using a quadrature approach is addressed. For quadrature representations, a number of optimisation strategies which are made possible by automated code generation are presented. The relative performance of two different automatically generated representations of finite element matrices is examined, with a particular emphasis on complicated variational forms. It is shown that approaches which perform best for simple forms are not tractable for more complicated problems in terms of run time performance, the time required to generate the code or the size of the generated code. The approach and optimisations elaborated here are effective for a range of variational forms.en
dc.language.isoenen
dc.rightsAll Rights Reserveden
dc.rights.urihttps://www.rioxx.net/licenses/all-rights-reserved/en
dc.subjectMathematical softwareen
dc.subjectNumerical analysisen
dc.subjectProgramming techniquesen
dc.subjectFinite element methodsen
dc.subjectAutomatic Programmingen
dc.titleRepresentations of finite element tensors via automated code generationen
dc.typeArticleen
dc.type.versionsubmitted version
pubs.declined2017-10-11T13:54:28.171+0100


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record