The algorithm to find intersections of two non-matching grids
主 题: The algorithm to find intersections of two non-matching grids
报告人: Oliver Sande (Institut für Mathematik II Freie Universit?t Berlin)
时 间: 2009-11-10 下午14:00 - 15:00
地 点: 资源大厦1203
He will explain the algorithm about how to fine intersections of two non-matching grids.
He will also explain some technical detail about how to move the grid in DUNE.
DUNE, the Distributed and Unified Numerics Environment is a modular
toolbox for solving partial differential equations (PDEs) with grid-based
methods. It supports the easy implementation of methods like
Finite Elements (FE), Finite Volumes (FV), and also Finite Differences (FD).
The homepage of DUNE is