A New Strategy Based on Augmented Lagrangian for a Class of Block Three-by-Three Linear Systems: An Application for Stokes Problems

In this paper, we propose a novel augmented Lagrangian preconditioner based on the global Arnoldi method for accelerating the convergence of Krylov subspace solvers applied to linear systems with a block three-by-three structure. Such systems typically arise from mixed finite element discretizations of the Stokes equations. In practice, the velocity components are approximated using a common finite element space. More specifically, in two dimensions, our approach relies on a standard scalar finite element basis to discretize the velocity space. This componentwise splitting naturally induces the desired block three-by-three structure. We establish spectral analyses for the exact versions of the proposed preconditioners. Numerical experiments further demonstrate that the new approach is more robust and efficient for solving discrete Stokes problems. In particular, efficiency is assessed in terms of reduced computational time, confirming the practical advantages of our method.

Authors

Institutions

Publication Details

Journal
International Journal of Computational Methods
Published
2025-11-07
DOI
https://doi.org/10.1142/s0219876225500756
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Strategy Based on Augmented Lagrangian for a Class of Block Three-by-Three Linear Systems: An Application for Stokes Problems

Achraf Badahmane
International Journal of Computational Methods
Matrix Theory and Algorithms
article

A New Strategy Based on Augmented Lagrangian for a Class of Block Three-by-Three Linear Systems: An Application for Stokes Problems

Achraf Badahmane
article en

Abstract

In this paper, we propose a novel augmented Lagrangian preconditioner based on the global Arnoldi method for accelerating the convergence of Krylov subspace solvers applied to linear systems with a block three-by-three structure. Such systems typically arise from mixed finite element discretizations of the Stokes equations. In practice, the velocity components are approximated using a common finite element space. More specifically, in two dimensions, our approach relies on a standard scalar finite element basis to discretize the velocity space. This componentwise splitting naturally induces the desired block three-by-three structure. We establish spectral analyses for the exact versions of the proposed preconditioners. Numerical experiments further demonstrate that the new approach is more robust and efficient for solving discrete Stokes problems. In particular, efficiency is assessed in terms of reduced computational time, confirming the practical advantages of our method.

International Journal of Computational MethodsVol. 23(04)
Université Mohammed VI Polytechnique (MA)
Openalex Percentile: Top 66%
Matrix Theory and Algorithms
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.