Abstract
The problem of interpolating between discrete fields arises frequently in computational physics. The obvious approach, consistent interpolation, has several drawbacks such as suboptimality, non-conservation, and unsuitability for use with discontinuous discretisations. An alternative, Galerkin projection, remedies these deficiencies; however, its implementation has proven very challenging. This paper presents an algorithm for the local implementation of Galerkin projection of discrete fields between meshes. This algorithm extends naturally to three dimensions and is very efficient. (C) 2010 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 89-100 |
Number of pages | 12 |
Journal | Computer Methods in Applied Mechanics and Engineering |
Volume | 200 |
Issue number | 1-4 |
DOIs | |
Publication status | Published - 2011 |
Keywords / Materials (for Non-textual outputs)
- ALGORITHMS
- Galerkin projection
- SIMULATIONS
- FLOW
- FINITE-ELEMENT PAIR
- Conservation
- ADAPTIVITY
- Supermesh
- Discontinuous Galerkin
- Interpolation