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 78 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 80 tok/s Pro
Kimi K2 127 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Preconditioning of the generalized Stokes problem arising from the approximation of the time-dependent Navier-Stokes equations (2407.01783v2)

Published 1 Jul 2024 in math.NA and cs.NA

Abstract: The paper compares standard iterative methods for solving the generalized Stokes problem arising from the time and space approximation of the time-dependent incompressible Navier-Stokes equations. Various preconditioning techniques are considered (Schur complement, fully coupled system, with and without augmented Lagrangian). One investigates whether these methods can compete with traditional pressure-correction and velocity-correction methods in terms of throughput (number of degrees of freedom per time step per core per second). Numerical tests on fine unstructured meshes (68 millions degrees of freedoms) demonstrate GMRES/CG convergence rates that are independent of the mesh size and improve with the Reynolds number for most methods. Three conclusions are drawn: (1) Whether solving the pressure Schur complement or the fully coupled system does not make any significant difference in terms of throughput. (2) Although very good parallel scalability is observed for the augmented Lagrangian method, the best throughput is achieved without using the augmented Lagrangian formulation. (3) The throughput of all the methods tested in the paper are on average 25 times slower than that of traditional pressure-correction and velocity-correction methods. Hence, although all these methods are very efficient for solving steady state problems, none of them is unfortunately competitive for solving time-dependent problems.

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

Collections

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

Summary

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

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

Follow-Up Questions

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube