Algorithm 932, PANG: software for nonmatching grid projections in 2D and 3D with linear complexity. We design and analyze an algorithm with linear complexity to perform projections between 2D and 3D nonmatching 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 already been presented in a short proceedings paper of the 18th International Conference on Domain Decomposition Methods [M. J. Gander and C. Japhet, Lect. Notes Comput. Sci. Eng. 70, 185–192 (2009; Zbl 1183.65161)].

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 18 articles )

Showing results 1 to 18 of 18.
Sorted by year (citations)

  1. Bastian, Peter; Blatt, Markus; Dedner, Andreas; Dreier, Nils-Arne; Engwer, Christian; Fritze, René; Gräser, Carsten; Grüninger, Christoph; Kempf, Dominic; Klöfkorn, Robert; Ohlberger, Mario; Sander, Oliver: The \textscDuneframework: basic concepts and recent developments (2021)
  2. Gander, Martin J.; Kwok, Felix; Mandal, Bankim C.: Dirichlet-Neumann waveform relaxation methods for parabolic and hyperbolic problems in multiple subdomains (2021)
  3. Li, Yipeng; Chen, Qiao; Wang, Xuebin; Jiao, Xiangmin: WLS-ENO remap: superconvergent and non-oscillatory weighted least squares data transfer on surfaces (2020)
  4. Albella, Jorge; Ben Dhia, Hachmi; Imperiale, Sebastien; Rodríguez, Jeronimo: Mathematical and numerical study of transient wave scattering by obstacles with a new class of Arlequin coupling (2019)
  5. Peter Bastian, Markus Blatt, Andreas Dedner, Nils-Arne Dreier, Christian Engwer, René Fritze, Carsten Gräser, Christoph Grüninger, Dominic Kempf, Robert Klöfkorn, Mario Ohlberger, Oliver Sander: The DUNE Framework: Basic Concepts and Recent Developments (2019) arXiv
  6. Abbas, Mickaël; Drouet, Guillaume; Hild, Patrick: The local average contact (LAC) method (2018)
  7. Hassan, Sarah Ali; Japhet, Caroline; Vohralík, Martin: A posteriori stopping criteria for space-time domain decomposition for the heat equation in mixed formulations (2018)
  8. Březina, Jan; Exner, Pavel: Fast algorithms for intersection of non-matching grids using Plücker coordinates (2017)
  9. Drouet, Guillaume; Hild, Patrick: An accurate local average contact method for nonmatching meshes (2017)
  10. Hoang, Thi-Thao-Phuong; Japhet, Caroline; Kern, Michel; Roberts, Jean E.: Space-time domain decomposition for advection-diffusion problems in mixed formulations (2017)
  11. Maddison, J. R.; Hiester, H. R.: Optimal constrained interpolation in mesh-adaptive finite element modeling (2017)
  12. Niemimäki, Ossi; Kurz, Stefan; Kettunen, Lauri: Structure-preserving mesh coupling based on the Buffa-Christiansen complex (2017)
  13. Wang, Cheng; Sun, Pengtao: A fictitious domain method with distributed Lagrange multiplier for parabolic problems with moving interfaces (2017)
  14. Duval, Mickaël; Passieux, Jean-Charles; Salaün, Michel; Guinard, Stéphane: Non-intrusive coupling: recent advances and scalable nonlinear domain decomposition (2016)
  15. Engwer, Christian; Müthing, Steffen: Concepts for flexible parallel multi-domain simulations (2016)
  16. Hoang, Thao-Phuong; Japhet, Caroline; Kern, Michel; Roberts, Jean E.: Space-time domain decomposition for reduced fracture models in mixed formulation (2016)
  17. Gander, Martin J.; Japhet, Caroline: Algorithm 932, PANG: software for nonmatching grid projections in 2D and 3D with linear complexity (2013)
  18. Gander, Martin J.; Japhet, Caroline: An algorithm for non-matching grid projections with linear complexity (2009)