SIAM Journal on Matrix Analysis and Applications · 2001 · 79 citations · 14 references
EngineeringMechanical EngineeringComputational Fluid DynamicsComputational MechanicsFluid DynamicsConvergence AnalysisIterative SolversNumerical AlgorithmsNumerical AnalysisNumerical ConvergenceRelaxation MethodsA Priori EstimatesIterative Methods For Linear SystemsNumerical Methods For Stokes FlowPreconditioningPreconditioning TechniquesSaddle Point ProblemsStokes Equations
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iteratively solving linear saddle-point problems. The method involves two variable relaxation parameters, which can be updated easily in each iteration, similar to the evaluation of the two iteration parameters in the conjugate gradient method. This new algorithm has an advantage over most existing Uzawa-type algorithms: it is always convergent without any a priori estimates on the spectrum of the preconditioned Schur complement matrix, which may not be easy to achieve in applications. The rate of the convergence of the inexact Uzawa method is analyzed. Numerical results of the algorithm applied for the Stokes problem and a purely linear system of algebraic equations are presented.
14
Studies in Linear and Nonlinear Programming
Hans Paul Künzi, J. K. Arrow, Leonid Hurwicz et al. · Econometrica · 1963 · 341 citations