On nonlinear inexact Uzawa algorithms for stabilized saddle point problems
- Lanzhou University, School of Mathematics and Statistics (China)
In this paper, the nonlinear inexact Uzawa (NIU) methods for saddle point problems are studied. A further improved convergence result of the NIU algorithm for stabilized saddle point problems is presented, which results in much smaller convergence factor. This result can also be viewed as a generalization of some previous work for classical saddle point problems. Based on this result, we generalize some adaptive versions of the NIU algorithm with variable iteration parameters for classical saddle point problems to solve stabilized saddle point problems. Convergence analyses of these algorithms are presented. It shows that they converge under similar conditions as those in classical cases, which are more practical and without estimates on the extreme eigenvalues of the involved preconditioned systems. Numerical experiments are given to demonstrate the effectiveness of these algorithms over some original NIU algorithms.
- OSTI ID:
- 22769320
- Journal Information:
- Computational and Applied Mathematics, Journal Name: Computational and Applied Mathematics Journal Issue: 2 Vol. 37; ISSN 0101-8205
- Country of Publication:
- United States
- Language:
- English
Similar Records
A new Uzawa method for fourth-order block saddle point problems
The generalized Uzawa-SHSS method for non-Hermitian saddle-point problems