The maximum principle is a major property of solutions of partial differential equations. In this work, we analyze a few constructive algorithms that allow one to embed this property into a mimetic finite difference (MFD) method. The algorithms search in the parametric family of MFD methods for a member that guarantees the discrete maximum principle (DMP). A set of sufficient conditions for the DMP is derived for a few types of meshes. For general meshes, a numerical optimization procedure is proposed and studied numerically.

Monotonicity Conditions in the Mimetic Finite Difference Method

G Manzini;
2011

Abstract

The maximum principle is a major property of solutions of partial differential equations. In this work, we analyze a few constructive algorithms that allow one to embed this property into a mimetic finite difference (MFD) method. The algorithms search in the parametric family of MFD methods for a member that guarantees the discrete maximum principle (DMP). A set of sufficient conditions for the DMP is derived for a few types of meshes. For general meshes, a numerical optimization procedure is proposed and studied numerically.
2011
Istituto di Matematica Applicata e Tecnologie Informatiche - IMATI -
978-3-642-20671-9
Mimetic method
discrete maximum principle
M-matrix
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/84846
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 10
social impact