Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems
- First Online:
- Cite this article as:
- Axelsson, O., Farouq, S. & Neytcheva, M. Numer Algor (2016) 73: 631. doi:10.1007/s11075-016-0111-1
- 174 Downloads
Saddle point matrices of a special structure arise in optimal control problems. In this paper we consider distributed optimal control for various types of scalar stationary partial differential equations and compare the efficiency of several numerical solution methods. We test the particular case when the arising linear system can be compressed after eliminating the control function. In that case, a system arises in a form which enables application of an efficient block matrix preconditioner that previously has been applied to solve complex-valued systems in real arithmetic. Under certain assumptions the condition number of the so preconditioned matrix is bounded by 2. The numerical and computational efficiency of the method in terms of number of iterations and elapsed time is favourably compared with other published methods.