An Augmented Lagrangian Preconditioner for Navier–Stokes Equations With Runge–Kutta in Time

ABSTRACT We consider an implicit Runge–Kutta method for the numerical time integration of the nonstationary incompressible Navier–Stokes equations. This yields a sequence of nonlinear problems to be solved for the stages of the Runge–Kutta method. The resulting nonlinear system of differential equations is discretized using a finite element method. To compute a numerical approximation of the stages at each time step, we employ Newton's method, which requires the solution of a large and sparse generalized saddle‐point problem at each nonlinear iteration. We devise an augmented Lagrangian preconditioner within the flexible GMRES method for solving the Newton systems at each time step. The preconditioner can be applied inexactly with the help of a multigrid routine. We present numerical evidence of the robustness and efficiency of the proposed strategy for different values of the viscosity, mesh size, time step, and number of stages of the Runge–Kutta method.

Authors

Institutions

Publication Details

Journal
Numerical Linear Algebra with Applications
Published
2026-05-27
DOI
https://doi.org/10.1002/nla.70087
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Augmented Lagrangian Preconditioner for Navier–Stokes Equations With Runge–Kutta in Time

Santolo Leveque, Maxim A. Olshanskii, Yunhui He
Numerical Linear Algebra with Applications
Advanced Numerical Methods in Computational Mathematics
article

An Augmented Lagrangian Preconditioner for Navier–Stokes Equations With Runge–Kutta in Time

Santolo Leveque, Maxim A. Olshanskii, Yunhui He
article en

Abstract

ABSTRACT We consider an implicit Runge–Kutta method for the numerical time integration of the nonstationary incompressible Navier–Stokes equations. This yields a sequence of nonlinear problems to be solved for the stages of the Runge–Kutta method. The resulting nonlinear system of differential equations is discretized using a finite element method. To compute a numerical approximation of the stages at each time step, we employ Newton's method, which requires the solution of a large and sparse generalized saddle‐point problem at each nonlinear iteration. We devise an augmented Lagrangian preconditioner within the flexible GMRES method for solving the Newton systems at each time step. The preconditioner can be applied inexactly with the help of a multigrid routine. We present numerical evidence of the robustness and efficiency of the proposed strategy for different values of the viscosity, mesh size, time step, and number of stages of the Runge–Kutta method.

Numerical Linear Algebra with ApplicationsVol. 33(3)
University of Houston (US)
National Science Foundation
Openalex Percentile: Top 99%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.