Residual reduction algorithms for nonsymmetric saddle point problems

DOI10.1016/J.CAM.2010.09.002MaRDI QIDQ611835zbMATH OpenOpenAlexFDO

Authors Constantin Bacuta, Brendan Mccracken, Lu Shu

Publication date 14 December 2010

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2010.09.002

zbMATH Keywords

incompressible Navier-Stokesmultilevel finite element solutionnonsymmetric Uzawa algorithmsoptimal parametersOseen problems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element methods applied to problems in solid mechanics (74S05)

Review text

Paralleling the work of Bramble-Pasciak-Vassilev and also based on earlier work by the first author, two versions of nonsymmetric Uzawa algorithms are investigated using spectral properties of the Schur complement. This leads to the derivation of optimal iteration parameters. The first method can be seen as a 2-parameter gradient iteration where for one parameter an interval is given, for the other the optimal value. The result applies to the finite and the infinite dimensional case. The second method is developed to improve the first one in the case of large Reynolds numbers and reduces, in every step of the iteration, the residual calculating both parameters optimally. The methods are applied to the steady-state incompressible Navier-Stokes equations led iteratively to Oseen equations. Numerical results are given for the driven cavity problem and show that even unstable finite element spaces combined with multilevel on uniform refinements can be used (though the reached accuracy then is much less than for stable spaces).

Recommendations

• Uzawa type algorithms for nonsymmetric saddle point problems
• Analysis of the inexact Uzawa algorithms for nonlinear saddle-point problems
• Uzawa algorithms with variable relaxation for nonsymmetric generalized saddle point problems.
• Fast Uzawa algorithms for solving non‐symmetric stabilized saddle point problems
• scientific article; zbMATH DE number 1241444

Cites work

• A Unified Approach for Uzawa Algorithms
• An Adaptive Uzawa FEM for the Stokes Problem: Convergence without the Inf-Sup Condition
• An analysis of a mixed finite element method for the Navier-Stokes equations
• An Optimal Adaptive Finite Element Method for the Stokes Problem
• Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• scientific article; zbMATH DE number 3148887 (Why is no real title available?)
• scientific article; zbMATH DE number 3912905 (Why is no real title available?)
• scientific article; zbMATH DE number 613872 (Why is no real title available?)
• scientific article; zbMATH DE number 911319 (Why is no real title available?)
• scientific article; zbMATH DE number 915500 (Why is no real title available?)
• scientific article; zbMATH DE number 2221749 (Why is no real title available?)
• Improving the Rate of Convergence of High-Order Finite Elements on Polyhedra I:A PrioriEstimates
• Improving the Rate of Convergence of High-Order Finite Elements on Polyhedra II: Mesh Refinements and Interpolation
• Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
• Mixed and Hybrid Finite Element Methods
• New interpolation results and applications to finite element methods for elliptic boundary value problems
• Nonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems
• Numerical solution of saddle point problems
• Optimal relaxation parameter for the Uzawa method
• Regularity estimates for solutions of the equations of linear elasticity in convex plane polygonal domains
• Schur complements on Hilbert spaces and saddle point systems
• Some observations on Babuška and Brezzi theories
• The analysis of multigrid methods
• Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems
• Using finite element tools in proving shift theorems for elliptic boundary value problems
• Uzawa type algorithms for nonsymmetric saddle point problems

Cited in

(11)

• The Uzawa-PPS iteration methods for nonsingular and singular non-Hermitian saddle point problems
• On PSS-based constraint preconditioners for singular nonsymmetric saddle point problems
• On semi-convergence of the generalized shift-splitting iteration method for singular nonsymmetric saddle point problems
• A saddle point least squares approach to mixed methods
• AOR-Uzawa iterative method for a class of complex symmetric linear system of equations
• On quasi shift-splitting iteration method for a class of saddle point problems
• A Local Positive (Semi)Definite Shift-Splitting Preconditioner for Saddle Point Problems with Applications to Time-Harmonic Eddy Current Models
• A fast shift-splitting iteration method for nonsymmetric saddle point problems
• Accelerating the Uzawa algorithm
• On convergence rate of the augmented Lagrangian algorithm for nonsymmetric saddle point problems
• Uzawa algorithms with variable relaxation for nonsymmetric generalized saddle point problems.

This page was built for publication: Residual reduction algorithms for nonsymmetric saddle point problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611835)