A preconditioner based on a splitting-type iteration method for solving complex symmetric indefinite linear systems. (English) Zbl 1483.65046
Summary: In this paper, we propose a preconditioned modified positive/negative-stable splitting (PMPNS) iteration method to solve complex symmetric indefinite linear system more efficiently. By analyzing the convergence of the PMPNS iteration method and discussing the spectral properties of the PMPNS iteration method, we construct a new preconditioner to make the eigenvalues of the coefficient matrix more aggregated, which leads to fast convergence of Krylov subspace iteration methods such as GMRES. Numerical example is given to illustrate the efficiency of the PMPNS preconditioner used in GMRES method. In particular, the GMRES method with the PMPNS preconditioner demonstrates meshsize-independent convergence behavior.
MSC:
| 65F08 | Preconditioners for iterative methods |
| 65F10 | Iterative numerical methods for linear systems |
Keywords:
complex symmetric indefinite linear system; complex symmetric matrix; preconditioning; matrix splittingReferences:
| [1] | Axelsson, O.; Kucherov, A., Real valued iterative methods for solving complex symmetric linear systems, Numer. Linear Algebra Appl., 7, 197-218 (2000) · Zbl 1051.65025 · doi:10.1002/1099-1506(200005)7:4<197::AID-NLA194>3.0.CO;2-S |
| [2] | Axelsson, O.; Neytcheva, M.; Ahmad, B., A comparison of iterative methods to solve complex valued linear algebraic systems, Numer. Algorithm, 66, 811-841 (2014) · Zbl 1307.65034 · doi:10.1007/s11075-013-9764-1 |
| [3] | Bai, Z., On preconditioned iteration methods for complex linear systems, J. Eng. Math., 93, 41-60 (2015) · Zbl 1360.65089 · doi:10.1007/s10665-013-9670-5 |
| [4] | Bai, Z.; Benzi, M.; Chen, F., Modified HSS iteration methods for a class of complex symmetric linear systems, Computing, 87, 93-111 (2010) · Zbl 1210.65074 · doi:10.1007/s00607-010-0077-0 |
| [5] | Bai, Z.; Benzi, M.; Chen, F., On preconditioned MHSS iteration methods for complex symmetric linear systems, Numer. Algorithm, 56, 297-317 (2011) · Zbl 1209.65037 · doi:10.1007/s11075-010-9441-6 |
| [6] | Bai, Z.; Golub, G.; Ng, M., Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems, SIAM J. Matrix Anal. Appl., 24, 603-626 (2003) · Zbl 1036.65032 · doi:10.1137/S0895479801395458 |
| [7] | Bai, Z.; Golub, G.; Pan, J., Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems, Numer. Math., 98, 1-32 (2004) · Zbl 1056.65025 · doi:10.1007/s00211-004-0521-1 |
| [8] | Bai, Z.; Golub, G., Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems, IMA J. Numer. Anal., 27, 1-23 (2007) · Zbl 1134.65022 · doi:10.1093/imanum/drl017 |
| [9] | Bayliss, A.; Goldstein, C.; Turkel, E., An iterative method for Helmholtz equation, J. Comput. Phys., 49, 443-457 (1983) · Zbl 0524.65068 · doi:10.1016/0021-9991(83)90139-0 |
| [10] | Benzi, M., A generalization of the Hermitian and skew-Hermitian splitting iteration, SIAM J. Matrix Anal. Appl., 31, 360-374 (2009) · Zbl 1191.65025 · doi:10.1137/080723181 |
| [11] | Benzi, M.; Golub, GH, A preconditioner for generalized saddle point problems, SIAM J. Matrix Anal. Appl., 26, 20-41 (2004) · Zbl 1082.65034 · doi:10.1137/S0895479802417106 |
| [12] | Benzi, M.; Bertaccini, D., Block preconditioning of real-valued iterative algorithms for complex linear systems, IMA J. Numer. Anal., 28, 598-618 (2007) · Zbl 1145.65022 · doi:10.1093/imanum/drm039 |
| [13] | Bunse-Gerstner, A.; Stöver, R., On a conjugate gradient-type method for solving complex symmetric linear systems, Linear Algebra Appl., 287, 105-123 (1999) · Zbl 0941.65031 · doi:10.1016/S0024-3795(98)10091-5 |
| [14] | Cui, L.; Li, M.; Song, Y., Preconditioned tensor splitting iterations method for solving multi-linear systems, Appl. Math. Lett., 96, 89-94 (2019) · Zbl 1503.65066 · doi:10.1016/j.aml.2019.04.019 |
| [15] | Day, D.; Heroux, M., Solving complex-valued linear systems via equivalent real formulations, SIAM J. Sci. Comput., 23, 480-498 (2001) · Zbl 0992.65020 · doi:10.1137/S1064827500372262 |
| [16] | Eisenstat, S.; Elman, HC; Schultz, MH, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal. Appl., 20, 345-357 (1983) · Zbl 0524.65019 · doi:10.1137/0720023 |
| [17] | Feriani, A.; Perotti, F.; Simoncini, V., Iterative system solvers for the frequency analysis of linear mechanical systems, Comput. Methods Appl. Mech. Eng., 190, 1719-1739 (2000) · Zbl 0981.70005 · doi:10.1016/S0045-7825(00)00187-0 |
| [18] | Freund, R., On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices, Numer. Math., 57, 285-312 (1990) · Zbl 0702.65034 · doi:10.1007/BF01386412 |
| [19] | Freund, R., Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices, SIAM J, Sci. Stat. Comput., 13, 425-448 (1990) · Zbl 0761.65018 · doi:10.1137/0913023 |
| [20] | Gu, X.; Huang, T.; Li, L.; Li, H.; Sogabe, T.; Clemens, M., Quasi-minimal residual variants of the COCG and COCR methods for complex symmetric linear systems in electromagnetic simulations, IEEE Trans. Microw. Theory Tech., 62, 2859-2867 (2014) · doi:10.1109/TMTT.2014.2365472 |
| [21] | Gu, X.; Clemens, M.; Huang, T.; Li, L., The SCBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems, Comput. Phys. Commun., 191, 52-64 (2015) · Zbl 1344.65041 · doi:10.1016/j.cpc.2015.01.018 |
| [22] | Guo, C., Incomplete block factorization preconditioner for linear systems arising in the numerical solution of the Helmholtz equation, Appl. Numer. Math., 19, 495-508 (1996) · Zbl 0854.65086 · doi:10.1016/0168-9274(95)00094-1 |
| [23] | Saad, Y.; Schultz, MH, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 7, 856-869 (1986) · Zbl 0599.65018 · doi:10.1137/0907058 |
| [24] | Simoncini, V.; Szyld, D., Recent computational developments in Krylov subspace methods for linear systems, Numer. Linear Algebra Appl., 14, 1-59 (2007) · Zbl 1199.65112 · doi:10.1002/nla.499 |
| [25] | Van der Vorst, H.; Melissen, J., A Petrov-Galerkin type method for solving Ax=b, where A is symmetric complex, IEEE Trans. Magn., 26, 706-708 (1990) · doi:10.1109/20.106415 |
| [26] | Wu, S.; Li, C., A modified SSOR preconditioning strategy for Helmholtz equations, J. Appl. Math., 2012, 1-10 (2012) · Zbl 1235.65126 |
| [27] | Wu, S.; Li, C., A splitting iterative method for the discrete dynamic linear systems, J. Comput. Appl. Math., 267, 49-60 (2014) · Zbl 1293.65050 · doi:10.1016/j.cam.2014.01.039 |
| [28] | Wu, S.; Li, C., A splitting method for complex symmetric indefinite linear system, J. Comput. Appl. Math., 313, 343-354 (2017) · Zbl 1353.65026 · doi:10.1016/j.cam.2016.09.028 |
| [29] | Xie, X.; Li, H., On preconditioned Euler-extrapolated single-step Hermitian and skew-Hermitian splitting method for complex symmetric linear systems, Jpn. J. Ind. Appl. Math. (2020) · Zbl 1472.65041 · doi:10.1007/s13160-020-00447-7 |
| [30] | Yang, J.; Zhao, X.; Ji, T.; Ma, T.; Huang, T., Low-rank tensor train for tensor robust principal component analysis, Appl. Math. Comput., 367, 1-15 (2020) · Zbl 1433.90118 |
| [31] | Yang, J.; Zhao, X.; Ji, T.; Ma, T.; Chen, Y.; Huang, T.; Ding, M., Remote sensing image destriping using unidirectional hybrid total variation and nonconvex low-rank regularization, J. Comput. Appl. Math., 363, 124-144 (2020) · Zbl 1429.94027 · doi:10.1016/j.cam.2019.06.004 |
| [32] | Zhang, J.; Dai, H., A new splitting preconditioner for the iterative solution of complex symmetric indefinite linear systems, App. Math. Lett., 49, 100-106 (2015) · Zbl 1382.65083 · doi:10.1016/j.aml.2015.05.006 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
