Publikation: Analysis of a Greedy Reconstruction Algorithm
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
A novel and detailed convergence analysis is presented for a greedy algorithm that was introduced in [Y. Maday and J. Salomon, Joint Proceedings of the 48th IEEE Conference on Decision and Control and the 28th Chinese Control Conference, 2009, pp. 375--379] for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of linearly independent matrices. The presented convergence analysis focuses on linear-quadratic (optimization) problems governed by linear differential systems and reveals the strong dependence of the performance of the greedy algorithm on the observability properties of the system and on the ansatz of the basis elements. Moreover, the analysis allows us to use a precise (and in some sense optimal) choice of basis elements for the linear case and led to the introduction of a new and more robust optimized greedy reconstruction algorithm. This optimized approach also applies to nonlinear Hamiltonian reconstruction problems, and its efficiency is demonstrated by numerical experiments.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
BUCHWALD, Simon, Gabriele CIARAMELLA, Julien SALOMON, 2021. Analysis of a Greedy Reconstruction Algorithm. In: SIAM Journal on Control and Optimization. SIAM. 2021, 59(6), pp. 4511-4537. ISSN 0363-0129. eISSN 1095-7138. Available under: doi: 10.1137/20M1373384BibTex
@article{Buchwald2021Analy-56129,
year={2021},
doi={10.1137/20M1373384},
title={Analysis of a Greedy Reconstruction Algorithm},
number={6},
volume={59},
issn={0363-0129},
journal={SIAM Journal on Control and Optimization},
pages={4511--4537},
author={Buchwald, Simon and Ciaramella, Gabriele and Salomon, Julien}
}RDF
<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/server/rdf/resource/123456789/56129">
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-01-14T12:40:15Z</dcterms:available>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:creator>Salomon, Julien</dc:creator>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56129"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:creator>Ciaramella, Gabriele</dc:creator>
<dc:creator>Buchwald, Simon</dc:creator>
<dcterms:abstract xml:lang="eng">A novel and detailed convergence analysis is presented for a greedy algorithm that was introduced in [Y. Maday and J. Salomon, Joint Proceedings of the 48th IEEE Conference on Decision and Control and the 28th Chinese Control Conference, 2009, pp. 375--379] for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of linearly independent matrices. The presented convergence analysis focuses on linear-quadratic (optimization) problems governed by linear differential systems and reveals the strong dependence of the performance of the greedy algorithm on the observability properties of the system and on the ansatz of the basis elements. Moreover, the analysis allows us to use a precise (and in some sense optimal) choice of basis elements for the linear case and led to the introduction of a new and more robust optimized greedy reconstruction algorithm. This optimized approach also applies to nonlinear Hamiltonian reconstruction problems, and its efficiency is demonstrated by numerical experiments.</dcterms:abstract>
<dc:language>eng</dc:language>
<dcterms:title>Analysis of a Greedy Reconstruction Algorithm</dcterms:title>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-01-14T12:40:15Z</dc:date>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:contributor>Buchwald, Simon</dc:contributor>
<dc:contributor>Ciaramella, Gabriele</dc:contributor>
<dcterms:issued>2021</dcterms:issued>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:contributor>Salomon, Julien</dc:contributor>
</rdf:Description>
</rdf:RDF>
