Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

Uniform-in-time convergence of numerical methods for non-linear degenerate parabolic equations (2003.09067v1)

Published 20 Mar 2020 in math.NA and cs.NA

Abstract: Gradient schemes is a framework that enables the unified convergence analysis of many numerical methods for elliptic and parabolic partial differential equations: conforming and non-conforming Finite Element, Mixed Finite Element and Finite Volume methods. We show here that this framework can be applied to a family of degenerate non-linear parabolic equations (which contain in particular the Richards', Stefan's and Leray--Lions' models), and we prove a uniform-in-time strong-in-space convergence result for the gradient scheme approximations of these equations. In order to establish this convergence, we develop several discrete compactness tools for numerical approximations of parabolic models, including a discontinuous Ascoli-Arzel`a theorem and a uniform-in-time weak-in-space discrete Aubin-Simon theorem. The model's degeneracies, which occur both in the time and space derivatives, also requires us to develop a discrete compensated compactness result.

Citations (63)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.