Gradient discretisation method
Material type:
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
![]() |
NISER LIBRARY | 519.6 DRO-G (Browse shelf(Opens below)) | Available | 25769 |
Browsing NISER LIBRARY shelves Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
519.6 CHA-N Numerical methods for engineers | 519.6 DEC-N Numerical Methods in Engineering | 519.6 DEC-N Numerical Methods in Engineering | 519.6 DRO-G Gradient discretisation method | 519.6 GJO-P Practical mathematical cryptography | 519.6 GRA-N Numerical mathematics | 519.6 HUT-S A student's guide to numerical methods |
Includes bibliographical references and index
This monograph presents the Gradient Discretisation Method (GDM), which is a unified convergence analysis framework for numerical methods for elliptic and parabolic partial differential equations. The results obtained by the GDM cover both stationary and transient models; error estimates are provided for linear (and some non-linear) equations, and convergence is established for a wide range of fully non-linear models (e.g. Leray–Lions equations and degenerate parabolic equations such as the Stefan or Richards models). The GDM applies to a diverse range of methods, both classical (conforming, non-conforming, mixed finite elements, discontinuous Galerkin) and modern (mimetic finite differences, hybrid and mixed finite volume, MPFA-O finite volume), some of which can be built on very general meshes.
There are no comments on this title.