A Relaxed Splitting Preconditioner for the Incompressible Navier‐Stokes Equations
Journal of Applied MathematicsPublished 1 January 2012Open access
Ning-Bo Tan, Ting‐Zhu Huang, Ze-Jun Hu
Citations48
SJR quartileQ3
SJR score0.28
SNIP0.70
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A relaxed splitting preconditioner based on matrix splitting is introduced in this paper for linear systems of saddle point problem arising from numerical solution of the incompressible Navier-Stokes equations.
Abstract
A relaxed splitting preconditioner based on matrix splitting is introduced in this paper for linear systems of saddle point problem arising from numerical solution of the incompressible Navier‐Stokes equations. Spectral analysis of the preconditioned matrix is presented, and numerical experiments are carried out to illustrate the convergence behavior of the preconditioner for solving both steady and unsteady incompressible flow problems.
Keywords
Computer ScienceEngineeringPhysics and Astronomy
Society for Industrial and Applied Mathematics eBooksIterative Methods for Sparse Linear Systems
13,730 Citations2003Yousef Saad
This chapter discusses methods related to the normal equations of linear algebra, and some of the techniques used in this chapter were derived from previous chapters of this book.
Acta NumericaNumerical solution of saddle point problems
2,298 Citations2005Michele Benzi, Gene H. Golub +1 more
A large selection of solution methods for linear systems in saddle point form are presented, with an emphasis on iterative methods for large and sparse problems.
Society for Industrial and Applied Mathematics eBooksDirect Methods for Sparse Linear Systems
1,414 Citations2006Timothy A. Davis
This paper presents a meta-modelling framework for solving sparse linear systems using cholesky factorization and CSparse, and some examples show how this framework can be modified to handle sparse matrices.
Finite Elements and Fast Iterative Solvers: with Applications in Incompressible Fluid Dynamics
1,196 Citations2005Howard C. Elman, David J. Silvester +1 more
SIAM Journal on Matrix Analysis and ApplicationsHermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
1,002 Citations2003Zhong‐Zhi Bai, Gene H. Golub +1 more
An upper bound of the contraction factor of the HSS iteration is derived which is dependent solely on the spectrum of the Hermitian part and is independent of the eigenvectors of the matrices involved.
SIAM Journal on Matrix Analysis and ApplicationsAn Approximate Minimum Degree Ordering Algorithm
718 Citations1996Patrick Amestoy, Timothy A. Davis +1 more
An approximate minimum degree (AMD) ordering algorithm for preordering a symmetric sparse matrix prior to numerical factorization is presented and produces results that are comparable in quality with the best orderings from other minimum degree algorithms.
SIAM Journal on Matrix Analysis and ApplicationsA Preconditioner for Generalized Saddle Point Problems
426 Citations2004Michele Benzi, Gene H. Golub
A preconditioning strategy based on the symmetric\slash skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditionsed matrix are established.
ACM Transactions on Mathematical SoftwareAlgorithm 866
287 Citations2007Howard C. Elman, Alison Ramage +1 more
IFISS is a graphical Matlab package for the interactive numerical study of incompressible flow problems that includes algorithms for discretization by mixed finite element methods and a posteriori error estimation of the computed solutions.
SIAM Journal on Scientific ComputingAn Augmented Lagrangian‐Based Approach to the Oseen Problem
255 Citations2006Michele Benzi, Maxim A. Olshanskii
An effective solver for the discrete Oseen problem based on an augmented Lagrangian formulation of the corresponding saddle point system based on a block triangular preconditioner used with a Krylov subspace iteration like BiCGStab is described.
Journal of Computational PhysicsA Relaxed Dimensional Factorization preconditioner for the incompressible Navier–Stokes equations
105 Citations2011Michele Benzi, Michael K. Ng +2 more
Numerical results for a variety of finite element discretizations of both steady and unsteady incompressible flow problems indicate very good behavior of the RDF preconditioner with respect to both mesh size and viscosity.
Numerische MathematikExistence and uniqueness of splittings for stationary iterative methods with applications to alternating methods
104 Citations1997Michele Benzi, Daniel B. Szyld
International Journal for Numerical Methods in FluidsModified augmented Lagrangian preconditioners for the incompressible Navier–Stokes equations
103 Citations2010Michele Benzi, Maxim A. Olshanskii +1 more
Applied Numerical MathematicsA dimensional split preconditioner for Stokes and linearized Navier–Stokes equations
95 Citations2010Michele Benzi, Xue-Ping Guo
A new preconditioner for linear systems of saddle point type arising from the numerical solution of the Navier-Stokes equations is introduced, based on a dimensional splitting of the problem along the components of the velocity field, resulting in a convergent fixed-point iteration.
SIAM Journal on Scientific ComputingLeast Squares Preconditioners for Stabilized Discretizations of the Navier–Stokes Equations
76 Citations2007Howard C. Elman, Victoria E. Howle +3 more
Two stabilization schemes for the least squares commutator (LSC) preconditioner developed by Elman, Howle, Shadid, Shuttleworth, and Tuminaro are introduced and shown how to extend the same methodology to stabilized low-order mixed finite element approximation methods.
SIAM Journal on Scientific ComputingPressure Schur Complement Preconditioners for the Discrete Oseen Problem
65 Citations2007Maxim A. Olshanskii, Yuri Vassilevski
It is concluded that in spite of essential improvement in comparison with “simple” scaled mass-matrix preconditioners in certain cases, none of the considered approaches provides satisfactory convergence rates in the case of small viscosity coefficients and a sufficiently complex advection vector field.
SIAM Journal on Scientific ComputingAnalysis of Augmented Lagrangian-Based Preconditioners for the Steady Incompressible Navier–Stokes Equations
64 Citations2011Michele Benzi, Zhen Wang
University Libraries (University of Maryland)BOUNDARY CONDITIONS IN APPROXIMATE COMMUTATOR PRECONDITIONERS FOR THE NAVIER-STOKES EQUATIONS ∗
58 Citations2009Howard C. Elman, Ray Tuminaro
It is shown that it is sometimes possible to choose boundary conditions to force the commutators of interest to be zero at boundaries, and this leads to a new strategy for choosing boundary conditions for the purpose of specifying precondi- tioning operators.
SIAM Journal on Scientific ComputingAn Efficient Solver for the Incompressible Navier–Stokes Equations in Rotation Form
36 Citations2007Michele Benzi, Jia Liu
This work focuses on a preconditioning technique based on the Hermitian/skew-Hermitian splitting of the resulting nonsymmetric saddle point matrix and shows that this technique can be implemented efficiently when the rotation form of the momentum equations is used.
Numerical Linear Algebra with ApplicationsNew multigrid smoothers for the Oseen problem
27 Citations2010Steven Hamilton, Michele Benzi +1 more
A direct comparison shows that the new smoothers compare favorably to coupled smoothers of Braess–Sarazin type, especially in terms of scaling for increasing Reynolds number.