An Algorithm for Non-Matching Grid Projections with Linear Complexity
DOI10.1007/978-3-642-02677-5_19zbMath1183.65161OpenAlexW1532038466MaRDI QIDQ3403929
Martin J. Gander, Caroline Japhet
Publication date: 5 February 2010
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://archive-ouverte.unige.ch/unige:6553
algorithmdomain decompositionnumerical experimentsfinite elementpatch methodlinear complexitymortar methodsadvancing front techniqueparallel grid generation
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Complexity and performance of numerical algorithms (65Y20)
Related Items (8)
Uses Software
This page was built for publication: An Algorithm for Non-Matching Grid Projections with Linear Complexity