Unified framework for finite element assembly

@article{Alns2009UnifiedFF,
  title={Unified framework for finite element assembly},
  author={Martin Sandve Aln{\ae}s and Anders Logg and Kent‐Andre Mardal and Ola Skavhaug and Hans Petter Langtangen},
  journal={Int. J. Comput. Sci. Eng.},
  year={2009},
  volume={4},
  pages={231-244}
}
At the heart of any finite element simulation is the assembly of matrices and vectors from discrete variational forms. We propose a general interface between problem-specific and general-purpose components of finite element programs. This interface is called Unified Form-assembly Code (UFC). A wide range of finite element problems is covered, including mixed finite elements and discontinuous Galerkin methods. We discuss how the UFC interface enables implementations of variational form… 

Figures from this paper

Efficient implementation of finite element methods on non-matching and overlapping meshes in 3D

TLDR
This note addresses the main challenges of an implementation of a fully general code for automatic detection of mesh intersections and integration over cut cells and subsimplices and considers Nitsche's method, a canonical example of an overlapping mesh method.

Efficient Implementation of Finite Element Methods on Nonmatching and Overlapping Meshes in Three Dimensions

TLDR
This note addresses the main challenges of an implementation of a fully general code for automatic detection of mesh intersections and integration over cut cells and subsimplices and considers Nitsche's method, which is a canonical example of an overlapping mesh method.

Unified Embedded Parallel Finite Element Computations via Software-Based Fr[e-acute]chet Differentiation

TLDR
A mathematical framework is presented that unifies the discretization of PDEs with these additional analysis requirements and provides high-level programming abstractions for the automatic, efficient evaluation of finite variational forms together with the derived operators required by engineering analysis.

A stabilized Nitsche overlapping mesh method for the Stokes problem

TLDR
A Nitsche-based formulation for a general class of stabilized finite element methods for the Stokes problem posed on a pair of overlapping, non-matching meshes is developed and it is proved that the method is stable, consistent, and optimally convergent.

Efficient representation of computational meshes

  • A. Logg
  • Computer Science
    Int. J. Comput. Sci. Eng.
  • 2009
TLDR
A straightforward and efficient storage scheme for mesh representations and efficient algorithms for computation of arbitrary incidence relations from a given initial and minimal set of incidence relations are discussed.

An automated hierarchical eXtended finite element approach for multiphysics problems involving discontinuities

TLDR
The hierarchical eXtended finite element method is implemented as toolbox miXFEM for the FEniCS framework and can be used to rapidly implement and simulate problems from different areas such as multiphase flow or other problems with evolving geometries.

Iterative solution of a mixed finite element discretisation of an incompressible magnetohydrodynamics problem

TLDR
A broad-scope code has been generated using the finite element software package FEniCS and the linear algebra software PETSc to develop and numerically test a large scale preconditioned finite element implementation of an incompressible magnetohydrodynamics model.

Automated Modelling of Evolving Discontinuities

TLDR
The automated approximation of solutions to differential equations which involve discontinuities across evolving surfaces is addressed by exploring the scope for employing automated code generation techniques for modelling discontinUities.

Numerical Construction of Static Fluid Interfaces with the Embedding Formalism

This research project develops a mathematical and numerical framework for representing static fluid interfaces as embedded manifolds. A variational principle is developed for the embedding function

Optimal Constrained Interpolation in Mesh-Adaptive Finite Element Modeling

TLDR
Extensions to mesh-to-mesh Galerkin $L^2$ projection are considered which are optimal and ensure exact conservation of key discrete properties, including preservation of both the L^2 norm and the integral, and preservation of the $L ^2$ norm and weak incompressibility.
...

References

SHOWING 1-10 OF 44 REFERENCES

Flexible Representation of Computational Meshes

TLDR
A new representation of computational meshes is proposed in terms of a covering relation defined by discrete topological objects the authors call sieves, which cleanly separates the topology of the mesh from its geometry and other value-storage mechanisms.

A compiler for variational forms

TLDR
A new algorithm for automatic and efficient evaluation of multilinear variational forms is presented, implemented in the form of a compiler, the FEniCS Form Compiler (FFC), which presents benchmark results for a series of standard variational Forms.

Efficient representation of computational meshes

  • A. Logg
  • Computer Science
    Int. J. Comput. Sci. Eng.
  • 2009
TLDR
A straightforward and efficient storage scheme for mesh representations and efficient algorithms for computation of arbitrary incidence relations from a given initial and minimal set of incidence relations are discussed.

Algorithm 839: FIAT, a new paradigm for computing finite element basis functions

TLDR
This work presents a new approach that allows us to construct a general class of finite element basis functions from orthonormal polynomials and evaluate and differentiate them at any points.

deal.II—A general-purpose object-oriented finite element library

TLDR
The paper presents a detailed description of the abstractions chosen for defining geometric information of meshes and the handling of degrees of freedom associated with finite element spaces, as well as of linear algebra, input/output capabilities and of interfaces to other software, such as visualization tools.

Mesh algorithms for PDE with Sieve I: Mesh distribution

TLDR
A new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes, and a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface.

A generic grid interface for parallel and adaptive scientific computing. Part I: abstract framework

TLDR
The definitions in this article serve as the basis for an implementation of an abstract grid interface as C++ classes in the framework (Bastian et al. 2008, this issue).

Efficient compilation of a class of variational forms

TLDR
An algorithm for efficient pretabulation of the reference tensor is designed and implemented in the FEniCS Form Compiler and improves on a previous loop-based implementation by several orders of magnitude, thus shortening compile-times and development cycles for users of FFC.

The finite element method for elliptic problems

  • P. Ciarlet
  • Mathematics
    Classics in applied mathematics
  • 2002
From the Publisher: This book is particularly useful to graduate students, researchers, and engineers using finite element methods. The reader should have knowledge of analysis and functional