全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

New Preconditioners for Nonsymmetric Saddle Point Systems with Singular Block

DOI: 10.1155/2013/507817

Full-Text   Cite this paper   Add to My Lib

Abstract:

We investigate the solution of large linear systems of saddle point type with singular block by preconditioned iterative methods and consider two parameterized block triangular preconditioners used with Krylov subspace methods which have the attractive property of improved eigenvalue clustering with increased ill-conditioning of the block of the saddle point matrix, including the choice of the parameter. Meanwhile, we analyze the spectral characteristics of two preconditioners and give the optimal parameter in practice. Numerical experiments that validate the analysis are presented. 1. Introduction We study preconditioners for general nonsingular linear systems of the type Such systems arise in a large number of applications, for example, the (linearized) Navier-Stokes equations and other physical problems with conservation laws as well as constrained optimization problems [1–5]. As such systems are typically large and sparse, solution by iterative methods has been studied extensively [1, 5–16]. Much attention has focused on the Navier-Stokes problem; see, for example, [1, 2, 5, 17, 18]. The techniques for solving systems like (1) are so numerous that it is almost impossible to give an overview. In addition to the methods developed specifically for Navier-Stokes problems, existing techniques also include splitting schemes [2, 6, 12, 19, 20], constraint preconditioning [2, 20, 21], Uzawa-type algorithms [2, 12, 22], and (preconditioned) Krylov subspace methods based on (approximations to) the Schur complement [2, 16, 23]. We start with augmentation block triangular preconditioners for the general system (1); see Section 2 for our assumptions. When is nonsingular, results for the general system have been obtained before; for example, Murphy et al. [23, 24] propose the block diagonal Schur complement preconditioner and the block triangular Schur complement preconditioner as follows: If defined, it has been shown that the preconditioned matrices (cf. [24]) are diagonalizable and have only three distinct eigenvalues , and two distinct eigenvalues , , respectively. However, when is singular, it cannot be inverted and the Schur complement does not exist. For symmetric saddle point systems, that is, and is symmetric, one possible way of dealing with the systems is by augmentation, that is, by replacing with , where is an symmetric positive definite weight matrix [4, 7, 9, 14, 17, 18, 25–27]. Recently, for symmetric saddle point systems with block that has a high nullity, Greif and Sch?tzau [25, 26] studied the application of the following block diagonal

References

[1]  O. Axelsson, “Preconditioning of indefinite problems by regularization,” SIAM Journal on Numerical Analysis, vol. 16, pp. 58–69, 1979.
[2]  M. Benzi, G. H. Golubt, and J. Liesen, “Numerical solution of saddle point problems,” Acta Numerica, vol. 14, pp. 1–137, 2005.
[3]  P. E. Gill, W. Murray, D. B. Ponceleon, and M. A. Saunders, “Preconditioners for indefinite systems arising in optimization,” SIAM Journal on Matrix Analysis and Applications, vol. 13, pp. 292–311, 1992.
[4]  T. Rees and C. Greif, “A preconditioner for linear systems arising from interior point optimization methods,” SIAM Journal on Scientific Computing, vol. 29, no. 5, pp. 1992–2007, 2007.
[5]  A. Wathen and D. Silvester, “Fast iterative solution of stabilized stokes systems part I: using simple diagonal preconditioners,” SIAM Journal on Numerical Analysis, vol. 30, no. 3, pp. 630–649, 1993.
[6]  Z. Bai, G. H. Golub, and M. K. Ng, “Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems,” SIAM Journal on Matrix Analysis and Applications, vol. 24, no. 3, pp. 603–626, 2003.
[7]  G. H. Golub and C. Greif, “On solving block-structured indefinite linear systems,” SIAM Journal on Scientific Computing, vol. 24, no. 6, pp. 2076–2092, 2003.
[8]  B. J. Bunch and B. N. Parlett, “Direct methods for solving symmetric indefinite systems of linear equations,” SIAM Journal on Numerical Analysis, vol. 8, no. 4, pp. 639–655, 1971.
[9]  Z. Chen and J. Zou, “An augmented lagrangian method for identifying discontinuous parameters in elliptic systems,” SIAM Journal on Control and Optimization, vol. 37, no. 3, pp. 892–910, 1999.
[10]  P. Ciarlet Jr., J. Huang, and J. Zou, “Some observations on generalized saddle-point problems,” SIAM Journal on Matrix Analysis and Applications, vol. 25, no. 1, pp. 224–236, 2004.
[11]  I. S. Duff and J. K. Reid, “Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems,” ACM Transactions on Mathematical Software, vol. 22, no. 2, pp. 227–257, 1996.
[12]  G. H. Golub, X. Wu, and J. Yuan, “SOR-like methods for augmented systems,” BIT Numerical Mathematics, vol. 41, no. 1, pp. 71–85, 2001.
[13]  W. Hackbusch, Iterative Solution of Large Sparse Systems of Equations, Springer, Berlin, Germany, 1994.
[14]  Q. Hu, Z. Shi, and D. Yu, “Efficient solvers for saddle-point problems arising from domain decompositions with lagrange multipliers,” SIAM Journal on Numerical Analysis, vol. 42, no. 3, pp. 905–933, 2004.
[15]  C. C. Paige and M. A. Saunders, “Solution of sparse indefinite systems of linear equations,” SIAM Journal on Numerical Analysis, vol. 12, no. 4, pp. 617–629, 1975.
[16]  Y. Saad, Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia, Pa, USA, 2nd edition, 2003.
[17]  M. Benzi and J. Liu, “Block preconditioning for saddle point systems with indefinite (1, 1) block,” International Journal of Computer Mathematics, vol. 84, no. 8, pp. 1117–1129, 2007.
[18]  G. Cheng, T. Huang, and S. Shen, “Block triangular preconditioners for the discretized time-harmonic Maxwell equations in mixed form,” Computer Physics Communications, vol. 180, no. 2, pp. 192–196, 2009.
[19]  Z. Bai, G. H. Golub, and J. Pan, “Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems,” Numerische Mathematik, vol. 98, no. 1, pp. 1–32, 2004.
[20]  Z. Bal, M. K. Ng, and Z. Wang, “Constraint preconditioners for symmetric indefinite matrices,” SIAM Journal on Matrix Analysis and Applications, vol. 31, no. 2, pp. 410–433, 2009.
[21]  C. Keller, N. I. M. Gould, and A. J. Wathen, “Constraint preconditioning for indefinite linear systems,” SIAM Journal on Matrix Analysis and Applications, vol. 21, no. 4, pp. 1300–1317, 2000.
[22]  A. Frangioni and C. Gentile, “New preconditioners for KKT systems of network flow problems,” SIAM Journal on Optimization, vol. 14, no. 3, pp. 894–913, 2004.
[23]  I. C. F. Ipsen, “A note on preconditioning nonsymmetric matrices,” SIAM Journal on Scientific Computing, vol. 23, no. 3, pp. 1050–1051, 2002.
[24]  M. F. Murphy, G. H. Golub, and A. J. Wathen, “Note on preconditioning for indefinite linear systems,” SIAM Journal on Scientific Computing, vol. 21, no. 6, pp. 1969–1972, 2000.
[25]  C. Greif and D. Sch?tzau, “Preconditioners for saddle point linear systems with highly singular (1, 1) blocks,” Electronic Transactions on Numerical Analysis, vol. 22, pp. 114–121, 2006.
[26]  C. Greif and D. Sch?tzau, “Preconditioners for the discretized time-harmonic Maxwell equations in mixed form,” Numerical Linear Algebra with Applications, vol. 14, no. 4, pp. 281–297, 2007.
[27]  Z. Cao, “Augmentation block preconditioners for saddle point-type matrices with singular (1, 1) blocks,” Numerical Linear Algebra with Applications, vol. 15, no. 6, pp. 515–533, 2008.
[28]  H. C. Elman, D. J. Silvester, and A. J. Wathen, “Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations,” Numerische Mathematik, vol. 90, no. 4, pp. 665–688, 2002.
[29]  R. W. Freund, “Preconditioning of symmetric, but highly indefinite linear systems,” in Proceedings of the 15th IMACS World Congress on Scientific Computation, Modeling and Applied Mathematics, pp. 551–556, 1997.
[30]  A. Klawonn and G. Starke, “Block triangular preconditioners for nonsymmetric saddle point problems: field-of-values analysis,” Numerische Mathematik, vol. 81, no. 4, pp. 577–594, 1999.
[31]  V. Simoncini, “Block triangular preconditioners for symmetric saddle-point problems,” Applied Numerical Mathematics, vol. 49, no. 1, pp. 63–80, 2004.
[32]  E. De Sturler and J. Liesen, “Block-diagonal and constraint preconditioners for nonsymmetric indefinite linear systems. Part I: theory,” SIAM Journal on Scientific Computing, vol. 26, no. 5, pp. 1598–1619, 2005.
[33]  K. Toh, K. Phoon, and S. Chan, “Block preconditioners for symmetric indefinite linear systems,” International Journal for Numerical Methods in Engineering, vol. 60, no. 8, pp. 1361–1381, 2004.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413