×

Preconditioners based on matrix splitting for the structured systems from elliptic PDE-constrained optimization problems. (English) Zbl 07764784

Summary: With regard to the structured systems of linear equations, which arises from the Galerkin finite element discretizations of elliptic PDE-constrained optimization problems, some new preconditioners based on coefficient matrix splitting are established to speed up the convergence rate of Krylov subspace methods such as GMRES. Additionally, eigenvalue distribution of the corresponding preconditioned matrices is deeply discussed. Numerical simulations are carried out, the results of which exhibit that the corresponding preconditioned GMRES methods perform very well with the theoretical analysis results and are superior to other newly devised preconditioners.

MSC:

65F08 Preconditioners for iterative methods
65F10 Iterative numerical methods for linear systems
49M41 PDE constrained optimization (numerical aspects)
Full Text: DOI

References:

[1] Lions, J. L., Optimal Control of Systems (1968), Springer: Springer New York
[2] Gould, N. I.M.; Hribar, M. E.; Nocedal, J., On the solution of equality constrained quadratic programming problems arising in optimization. SIAM J. Sci. Comput., 1376-1395 (2001) · Zbl 0999.65050
[3] Paige, C. C.; Saunders, M. A., Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal., 617-629 (1975) · Zbl 0319.65025
[4] Rees, T.; Dollar, H. S.; Wathen, A. J., Optimal solvers for PDE-constrained optimization. SIAM J. Sci. Comput., 271-298 (2010) · Zbl 1208.49035
[5] Rees, T.; Stoll, M., Block-triangular preconditioners for PDE-constrained optimization. Numer. Linear Algebra Appl., 977-996 (2010) · Zbl 1240.65097
[6] Ke, Y.-F.; Ma, C.-F., Some preconditioners for elliptic PDE-constrained optimization problems. Comput. Math. Appl., 2795-2813 (2018) · Zbl 1415.65248
[7] Elman, H.; Silvester, D.; Wathen, A., Finite Elements and Fast Iterative Solvers: with Applications in Incompressible Fluid Dynamics. Numer. Math. Sci. Comput. (2005), Oxford University Press: Oxford University Press Oxford · Zbl 1083.76001
[8] Benzi, M., Preconditioning techniques for large linear systems: a survey. J. Comput. Phys., 418-477 (2002) · Zbl 1015.65018
[9] Bai, Z.-Z., Block preconditioners for elliptic PDE-constrained optimization problems. Computing, 379-395 (2011) · Zbl 1242.65121
[10] Bai, Z.-Z.; Hadjidimos, A., Optimization of extrapolated Cayley transform with non-Hermitian positive definite matrix. Linear Algebra Appl., 322-339 (2014) · Zbl 1300.65020
[11] Mirchi, H.; Salkuyeh, D. K., A new preconditioner for elliptic PDE-constrained optimization problems. Numer. Algorithms (2019)
[12] Fan, H.-T.; Zhu, X.-Y., A modified relaxed splitting preconditioner for generalized saddle point problems from the incompressible Navier-Stokes equations. Appl. Math. Lett., 18-26 (2016) · Zbl 1398.65037
[13] Cao, Y.; Jiang, M.-Q.; Zheng, Y.-L., A splitting preconditioner for saddle point problems. Numer. Linear Algebra Appl., 875-895 (2011) · Zbl 1249.65065
[14] Cao, Y.; Miao, S.-X.; Cui, Y.-S., A relaxed splitting preconditioner for generalized saddle point problems. Comput. Appl. Math., 865-879 (2015) · Zbl 1329.65068
[15] Pearson, J. W.; Wathen, A. J., A new approximation of the Schur complement in preconditioners for PDE-constrained optimization. Numer. Linear Algebra Appl., 816-829 (2012) · Zbl 1274.65187
[16] Hu, J.; Ke, Y.; Ma, C., Generalized conjugate direction algorithm for solving generalized coupled Sylvester transpose matrix equations over reflexive or anti-reflexive matrices. J. Franklin Inst., 6958-6985 (2022) · Zbl 1498.65057
[17] Ke, Y.; Ma, C., On SOR-like iteration methods for solving weakly nonlinear systems. Optim. Methods Softw., 320-337 (2022) · Zbl 1517.65036
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.