Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 173 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

A finite difference method for inhomogeneous incompressible Navier-Stokes equations (2302.14018v1)

Published 27 Feb 2023 in math.NA, cs.NA, and math.AP

Abstract: This paper provides mathematical analysis of an elementary fully discrete finite difference method applied to inhomogeneous (non-constant density and viscosity) incompressible Navier-Stokes system on a bounded domain. The proposed method consists of a version of Lax-Friedrichs explicit scheme for the transport equation and a version of Ladyzhenskaya's implicit scheme for the Navier-Stokes equations. Under the condition that the initial density profile is strictly away from $0$, the scheme is proven to be strongly convergent to a weak solution (up to a subsequence) within an arbitrary time interval, which can be seen as a proof of existence of a weak solution to the system. The results contain a new Aubin-Lions-Simon type compactness method with an interpolation inequality between strong norms of the velocity and a weak norm of the product of the density and velocity.

Citations (1)

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

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

Collections

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