Stable Crank-Nicolson Discretisation for Incompressible Miscible Displacement Problems of Low Regularity
classification
🧮 math.NA
cs.NA
keywords
problemsconvergencecrank-nicolsondiscretisationdisplacementincompressiblemethodmiscible
read the original abstract
In this article we study the numerical approximation of incompressible miscible displacement problems with a linearised Crank-Nicolson time discretisation, combined with a mixed finite element and discontinuous Galerkin method. At the heart of the analysis is the proof of convergence under low regularity requirements. Numerical experiments demonstrate that the proposed method exhibits second-order convergence for smooth and robustness for rough problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.