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

zbMATH Keywords

algorithmdomain decompositionnumerical experimentsfinite elementpatch methodlinear complexitymortar methodsadvancing front techniqueparallel grid generation

Mathematics Subject Classification ID

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)

A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic ⋮ Structural-acoustic coupling on non-conforming meshes with quadratic shape functions ⋮ Domain decomposition methods for the diffusion equation with low-regularity solution ⋮ Optimal Constrained Interpolation in Mesh-Adaptive Finite Element Modeling ⋮ Fully scalable implementation of a volume coupling scheme for the modeling of multiscale materials ⋮ A Parallel Approach to the Variational Transfer of Discrete Fields between Arbitrarily Distributed Unstructured Finite Element Meshes ⋮ On stable parametric finite element methods for the Stefan problem and the Mullins-Sekerka problem with applications to dendritic growth ⋮ Overlapping Multipatch Isogeometric Method with Minimal Stabilization

Uses Software

• Matlab
• PANG

This page was built for publication: An Algorithm for Non-Matching Grid Projections with Linear Complexity