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 158 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 117 tok/s Pro
Kimi K2 182 tok/s Pro
GPT OSS 120B 439 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

On the Analysis of the Second Order Time Filtered Backward Euler Method for the EMAC formulation of Navier-Stokes Equations (2106.04949v2)

Published 9 Jun 2021 in math.NA and cs.NA

Abstract: This paper considers the backward Euler based linear time filtering method for the EMAC formulation of the incompressible Navier-Stokes equations. The time filtering is added as a modular step to the standard backward Euler code leading to a 2-step, unconditionally stable, second order linear method. Despite its success in conserving important physical quantities when the divergence constraint is only weakly enforced, the EMAC formulation is unable to improve solutions of backward Euler discretized NSE. The combination of the time filtering with the backward Euler discretized EMAC formulation of NSE greatly increases numerical accuracy of solutions and still conserves energy, momentum and angular momentum as EMAC does. Several numerical experiments are provided that both verify the theoretical fidings and demonstrate superiority of the proposed method over the unfiltered case.

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.

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

Collections

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