Type of Publication: | Diploma thesis |
Publication status: | Published |
URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-2-qgy7rxfhsbp89 |
Author: | Jäkle, Christian |
Year of publication: | 2019 |
Summary: |
In this thesis we consider the numerical treatment of mixed-integer optimal control problems governed by linear convection-diffusion equations and binary control constraints. We use relaxation techniques for the optimal control problem which have been already used in mixed-integer optimal control problems for ordinary differential equations. The goal is to construct binary admissible controls such that the corresponding optimal state and the optimal value of the cost function of the relaxed problem can be approximated with arbitrary accuracy. To solve the optimal control problems of the relaxation we have to solve many state and adjoint equations. Using finite element methods to discretize the state and adjoint equations yields often to extensive systems which make the frequently calculations time-consuming. Therefore we apply a model-order reduction by the proper orthogonal decomposition (POD) method. This yields to a significant acceleration of the CPU time while the error stays small. Finally we present numerical experiments to verify the functionality of the presented algorithm and the quality of the solutions of the reduced problem.
|
Dissertation note: | Master thesis, Universität Konstanz |
Subject (DDC): | 510 Mathematics |
Link to License: | Terms of use |
Bibliography of Konstanz: | Yes |
JÄKLE, Christian, 2019. POD-Based Mixed-Integer Optimal Control of Convection-Diffusion Equations [Master thesis]. Konstanz: Universität Konstanz
@mastersthesis{Jakle2019PODBa-47332, title={POD-Based Mixed-Integer Optimal Control of Convection-Diffusion Equations}, year={2019}, address={Konstanz}, school={Universität Konstanz}, author={Jäkle, Christian} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/47332"> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/47332/5/Jaekle_2-qgy7rxfhsbp89.pdf"/> <dc:contributor>Jäkle, Christian</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dcterms:issued>2019</dcterms:issued> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/47332/5/Jaekle_2-qgy7rxfhsbp89.pdf"/> <dcterms:title>POD-Based Mixed-Integer Optimal Control of Convection-Diffusion Equations</dcterms:title> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/47332"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-11-04T06:21:11Z</dc:date> <dcterms:abstract xml:lang="eng">In this thesis we consider the numerical treatment of mixed-integer optimal control problems governed by linear convection-diffusion equations and binary control constraints. We use relaxation techniques for the optimal control problem which have been already used in mixed-integer optimal control problems for ordinary differential equations. The goal is to construct binary admissible controls such that the corresponding optimal state and the optimal value of the cost function of the relaxed problem can be approximated with arbitrary accuracy. To solve the optimal control problems of the relaxation we have to solve many state and adjoint equations. Using finite element methods to discretize the state and adjoint equations yields often to extensive systems which make the frequently calculations time-consuming. Therefore we apply a model-order reduction by the proper orthogonal decomposition (POD) method. This yields to a significant acceleration of the CPU time while the error stays small. Finally we present numerical experiments to verify the functionality of the presented algorithm and the quality of the solutions of the reduced problem.</dcterms:abstract> <dc:creator>Jäkle, Christian</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-11-04T06:21:11Z</dcterms:available> </rdf:Description> </rdf:RDF>
Jaekle_2-qgy7rxfhsbp89.pdf | 19 |