Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems
- 23 February 2016
- journal article
- Published by Springer Science and Business Media LLC in Numerical Algorithms
- Vol. 73 (3), 631-663
- https://doi.org/10.1007/s11075-016-0111-1
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A comparison of iterative methods to solve complex valued linear algebraic systemsNumerical Algorithms, 2013
- Numerical and computational efficiency of solvers for two-phase problemsComputers & Mathematics with Applications, 2012
- A new approximation of the Schur complement in preconditioners for PDE‐constrained optimizationNumerical Linear Algebra with Applications, 2011
- Nonstandard Norms and Robust Estimates for Saddle Point ProblemsSIAM Journal on Matrix Analysis and Applications, 2011
- Block-triangular preconditioners for PDE-constrained optimizationNumerical Linear Algebra with Applications, 2010
- Block preconditioners for elliptic PDE-constrained optimization problemsComputing, 2010
- Local Error Estimates for SUPG Solutions of Advection-Dominated Elliptic Linear-Quadratic Optimal Control ProblemsSIAM Journal on Numerical Analysis, 2010
- deal.II—A general-purpose object-oriented finite element libraryACM Transactions on Mathematical Software, 2007
- Optimal control of the convection-diffusion equation using stabilized finite element methodsNumerische Mathematik, 2007
- Any Nonincreasing Convergence Curve is Possible for GMRESSIAM Journal on Matrix Analysis and Applications, 1996