Minisymposia > Polygonal and Polyhedral Methods


Polygonal and Polyhedral Methods

Paola F. Antonietti (Politecnico di Milano, Italy)
Lourenco Beirao da Veiga (Università degli Studi di Milano, Italy)
Marco Verani (Politecnico di Milano, Italy)

The interest in using general polytopes (as opposed to more standard tetrahedra and hexahedra) for the discretization of partial differential equations enjoyed a very large growth in recent years, with the blossoming of various new methods and further development of existing ones (to name a few: polygonal fem, gradient methods and finite volumes, virtual elements, mimetic finite differences, polygonal Discontinuous Galerkin, weak Galerkin methods). The community is growing large, and interaction among different standpoints becomes very important. The aim of this minisymposium is to discuss recent developments in this area. The proposed topics include (but are not limited to) recent advances on polyhedral methods with particular attention to challenges in code development, fast solution techniques and application of polyhedral methods to real-life problems.

Online user: 1