Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-28T02:31:51.788Z Has data issue: false hasContentIssue false
  • English
  • Français

ANALYSIS OF THE INEXACT UZAWA ALGORITHMS FOR NONLINEAR SADDLE-POINT PROBLEMS

Part of: Numerical linear algebra

Published online by Cambridge University Press:  21 October 2010

JIAN-LEI LI ,
TING-ZHU HUANG  and
LIANG LI
JIAN-LEI LI*
Affiliation:
School of Mathematical Sciences, University of Electronic, Science and Technology of China, Chengdu, Sichuan 611731, PR China (email: [email protected], [email protected], [email protected])
TING-ZHU HUANG
Affiliation:
School of Mathematical Sciences, University of Electronic, Science and Technology of China, Chengdu, Sichuan 611731, PR China (email: [email protected], [email protected], [email protected])
LIANG LI
Affiliation:
School of Mathematical Sciences, University of Electronic, Science and Technology of China, Chengdu, Sichuan 611731, PR China (email: [email protected], [email protected], [email protected])
*
✉For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Inexact Uzawa algorithms for solving nonlinear saddle-point problems are proposed. A simple sufficient condition for the convergence of the inexact Uzawa algorithms is obtained. Numerical experiments show that the inexact Uzawa algorithms are convergent.

Keywords

convergence analysisinexact Uzawa algorithmiterative methodsnonlinear saddle-point problemspreconditioner

MSC classification

Secondary: 65F10: Iterative methods for linear systems
Type
Research Article
Information
The ANZIAM Journal , Volume 51 , Issue 3 , January 2010 , pp. 369 - 382
Copyright
Copyright © Australian Mathematical Society 2010

References

[1]Arrow, K., Hurwicz, L. and Uzawa, H., Studies in linear and nonlinear programming (Stanford University Press, Stanford, CA, 1958).Google Scholar
[2]Bacuta, C., “A unified approach for Uzawa algorithms”, SIAM J. Numer. Anal. 44 (2006) 2633–2649.CrossRefGoogle Scholar
[3]Bacuta, C., “Schur complements on Hilbert spaces and saddle point systems”, J. Comput. Appl. Math. 225 (2009) 581–593.CrossRefGoogle Scholar
[4]Bai, Z. Z., Parlett, B. N. and Wang, Z. Q., “On generalized successive overrelaxation methods for augmented linear systems”, Numer. Math. 102 (2005) 1–38.CrossRefGoogle Scholar
[5]Benzi, M., Golub, G. H. and Liesen, J., “Numerical solution of saddle point problems”, Acta Numer. 14 (2005) 1–137.CrossRefGoogle Scholar
[6]Bramble, J. H. and Pasciak, J. E., “A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems”, Math. Comp. 50 (1988) 1–17.CrossRefGoogle Scholar
[7]Bramble, J. H., Pasciak, J. E. and Vassilev, A. T., “Analysis of the inexact Uzawa algorithm for saddle point problems”, SIAM J. Numer. Anal. 34 (1997) 1072–1092.CrossRefGoogle Scholar
[8]Bramble, J. H., Pasciak, J. E. and Vassilev, A. T., “Uzawa type algorithms for nonsymmetric saddle point problems”, Math. Comp. 69 (1999) 667–689.CrossRefGoogle Scholar
[9]Chan, K. H., Zhang, K., Zou, J. and Schubert, G., “A non-linear, 3-D spherical α 2 dynamo using a finite element method”, Phys. Earth Planetary Int. 128 (2001) 35–50.CrossRefGoogle Scholar
[10]Chen, X. J., “Global and superlinear convergence of inexact Uzawa methods for saddle point problems with nondifferentiable mappings”, SIAM J. Numer. Anal. 35 (1998) 1130–1148.CrossRefGoogle Scholar
[11]Chen, X. J., “On preconditioned Uzawa methods and SOR methods for saddle point problems”, J. Comput. Appl. Math. 100 (1998) 207–224.CrossRefGoogle Scholar
[12]Chen, Z., Du, Q. and Zou, J., “Finite element methods with matching and nonmatching meshes for Maxwell equations with discontinuous coefficients”, SIAM J. Numer. Anal. 37 (2000) 1542–1570.CrossRefGoogle Scholar
[13]Cheng, X. L., “On the nonlinear inexact Uzawa algorithm for saddle-Point problems”, SIAM J. Numer. Anal. 37 (2000) 1930–1934.CrossRefGoogle Scholar
[14]Ciarlet, P. G., Introduction to numerical linear algebra and optimization (Cambridge University Press, Cambridge, 1989).CrossRefGoogle Scholar
[15]Clarke, F. H., Optimization and nonsmooth analysis (John Wiley, New York, 1983).Google Scholar
[16]Cui, M. R., “A sufficient condition for the inexact Uzawa algorithm for saddle point problems”, J. Comput. Appl. Math. 139 (2002) 189–196.CrossRefGoogle Scholar
[17]Cui, M. R., “Analysis of iterative algorithms of Uzawa type for saddle point problems”, Appl. Numer. Math. 50 (2004) 133–146.CrossRefGoogle Scholar
[18]Elman, H. C. and Golub, G. H., “Inexact and preconditioned Uzawa algorithms for saddle point problems”, SIAM J. Numer. Anal. 31 (1994) 1645–1661.CrossRefGoogle Scholar
[19]Elman, H. C. and Silvester, D. J., “Fast nonsymmetric iterations and preconditioning for Navier–Stoke equations”, SIAM J. Sci. Comput. 17 (1996) 33–46.CrossRefGoogle Scholar
[20]Fletcher, R., Practical methods of optimization, 2nd edn (John Wiley, Chichester, 1987).Google Scholar
[21]Girault, V. and Raviart, P. A., Finite element methods for Navier–Stokes equations (Springer, Berlin, Heidelberg, 1986).CrossRefGoogle Scholar
[22]Golub, G. H., Wu, X. and Yuan, J. Y., “SOR-like methods for augmented systems”, BIT. Numer. Math. 41 (2001) 71–85.CrossRefGoogle Scholar
[23]Hu, Q. Y. and Zou, J., “Two new variants of nonlinear inexact Uzawa algorithms for saddle point problems”, Numer. Math. 93 (2002) 333–359.CrossRefGoogle Scholar
[24]Hu, Q. Y. and Zou, J., “Nonlinear inexact Uzawa algorithms for linear and nonlinear saddle point problems”, SIAM J. Optim. 16 (2006) 798–825.CrossRefGoogle Scholar
[25]Jiang, H. and Qi, L., “Local uniqueness and Newton-type methods for nonsmooth variational inequalities”, J. Math. Anal. Appl. 196 (1996) 314–331.CrossRefGoogle Scholar
[26]Kelley, C. T., Iterative methods for linear and nonlinear equations (SIAM, Philadelphia, 1995).CrossRefGoogle Scholar
[27]McCormick, S., “Multigrid methods for variational problems: general theory for the V-cycle”, SIAM J. Numer. Anal. 22 (1985) 634–643.CrossRefGoogle Scholar
[28]Qi, L. and Sun, J., “A nonsmooth version of Newton’s method”, Math. Program. 58 (1993) 353–368.CrossRefGoogle Scholar
[29]Queck, W., “The convergence factor of preconditioned algorithms of the Arrow–Hurwicz type”, SIAM J. Numer. Anal. 26 (1989) 1016–1030.CrossRefGoogle Scholar
[30]Rusten, T. and Winther, R., “A preconditioned iterative method for saddlepoint problems”, SIAM J. Matrix Anal. Appl. 13 (1992) 887–904.CrossRefGoogle Scholar
[31]Saad, Y. and Schultz, M. H., “GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems”, SIAM J. Sci. Comput. 7 (1986) 856–869.CrossRefGoogle Scholar
[32]Silvester, D. J. and Wathen, A. J., “Fast iterative solution of stabilized Stokes systems part II: using general block preconditioners”, SIAM J. Numer. Anal. 31 (1994) 1352–1367.CrossRefGoogle Scholar
[33]Tseng, P., “Applications of a splitting algorithm to decomposition in convex programming and variational inequalities”, SIAM J. Control Optim. 29 (1991) 119–138.CrossRefGoogle Scholar
[34]Wathen, A. J. and Silvester, D. J., “Fast iterative solution of stabilized Stokes systems part I: using simple diagonal preconditioners”, SIAM J. Numer. Anal. 30 (1993) 630–649.CrossRefGoogle Scholar