Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Preconditioned iterative methods for PDE-constrained optimization problems with pointwise state constraints
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing.
2017 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Optimization problems constrained by partial differential equations (PDEs) arise in a variety of fields when one wants to optimize a system governed by a PDE. The goal is to compute a control variable such that a state variable is as close as possible to some desired state when control and state are coupled by some PDE. The control and state may have additional conditions acting on them, such as, the so-called box constraints which define upper and lower bounds on these variables. Here we study the optimal control of the Poison equation with pointwise inequality constraints on the state variable with Moreau-Yosida regularization. The state constraints make the optimality system nonlinear and a primal-dual active set method is used to solve it. In each nonlinear step a large saddle point system has to be solved. This system is generally ill-conditioned and preconditioning is required to efficiently solve the system with an iterative solution method. The preconditioner should also be efficiently realizable. The convergence rate is also dependent on model and discretization parameters, for this reason, a preconditioning technique needs to be applicable to a wide range of parameters. Three preconditioners are tested for the problem and compared in terms of iteration counts and execution time for wide range of problem and discretization parameters.

Place, publisher, year, edition, pages
2017. , p. 49
Series
UPTEC F, ISSN 1401-5757 ; 17001
National Category
Other Computer and Information Science
Identifiers
URN: urn:nbn:se:uu:diva-317428OAI: oai:DiVA.org:uu-317428DiVA, id: diva2:1081649
Educational program
Master Programme in Engineering Physics
Supervisors
Examiners
Available from: 2017-03-14 Created: 2017-03-14 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(21699 kB)160 downloads
File information
File name FULLTEXT01.pdfFile size 21699 kBChecksum SHA-512
9fc9185e25b5d80e31bec4cbff40973cf26bfb3638a681a8aae1ed2fcddddfc7af7cf1260b54959a8024098cd1a1b9fa8856d3e936dc4724b0bd36bc540befe9
Type fulltextMimetype application/pdf

By organisation
Division of Scientific Computing
Other Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 160 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 727 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf