A preconditioning technique for a class of PDE-constrained optimization problems (Q652568): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Trilinos / rank | |||
Normal rank |
Revision as of 13:04, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A preconditioning technique for a class of PDE-constrained optimization problems |
scientific article |
Statements
A preconditioning technique for a class of PDE-constrained optimization problems (English)
0 references
14 December 2011
0 references
A preconditioning technique for the linear equations resulting in the application of the inexact Newton method to the solution of discretized PDE constrained optimization problems is presented. The block triangular preconditioner \(P\) is based on a perturbed version of the Gauß-Newton Hessian. \(P\) is used as preconditioner for FGMRES. The Schur complement systems arising in the inversion of \(P\) are solved by a PCG method with ML smoothed aggregation AMG as preconditioner. For numerical experiments, a simplified version of the Monge-Kantorovich mass transfer problem involving a hyperbolic PDE constraint is investigated. The inexact Newton method converges rapidly, the number of FGMRES iterations is low, even in the case where the solutions of the Schur complement systems are only approximated with low relative accuracy. The computational effort does not scale well with the problem size, due to some problems going back to the ML preconditioner. Nevertheless, the new approach seems to be competitive in comparison to reduced-Hessian based methods.
0 references
preconditioning
0 references
Krylov subspace method
0 references
saddle point
0 references
PDE constrained optimization
0 references
Monge-Kantorovich problem
0 references