Algorithm 932: {PANG}: Software for Non-Matching Grid Projections in 2d and 3d with Linear Complexity

Martin Gander 1 Caroline Japhet 2, 3
3 MCS
LAGA - Laboratoire Analyse, Géométrie et Applications, CSCAMM - Center for Scientific Computation and Mathematical Modeling
Abstract : We design and analyze an algorithm with linear complexity to perform projections between 2d and 3d non-matching grids. This algorithm, named the PANG algorithm, is based on an advancing front technique and neighboring information. Its implementation is surprisingly short, and we give the entire Matlab code. For computing the intersections, we use a direct and numerically robust approach. We show numerical experiments both for 2d and 3d grids, which illustrate the optimal complexity and negligible overhead of the algorithm. An outline of this algorithm has been presented already in a short proceedings paper of the 18th international conference on domain decomposition methods, (see Gander and Japhet [2008]).
Type de document :
Article dans une revue
ACM Transactions on Mathematical Software, Association for Computing Machinery, 2013, 40 (1), pp.6:1--6:25. 〈10.1145/2513109.2513115〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00933643
Contributeur : Caroline Japhet <>
Soumis le : lundi 20 janvier 2014 - 18:01:31
Dernière modification le : vendredi 25 mai 2018 - 12:02:06

Identifiants

Citation

Martin Gander, Caroline Japhet. Algorithm 932: {PANG}: Software for Non-Matching Grid Projections in 2d and 3d with Linear Complexity. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2013, 40 (1), pp.6:1--6:25. 〈10.1145/2513109.2513115〉. 〈hal-00933643〉

Partager

Métriques

Consultations de la notice

442