Greedy sampling of distributed parameters in the reduced-basis method by numerical optimization

Lade...
Vorschaubild
Dateien
Iapichino_Volkwein_315.pdf
Iapichino_Volkwein_315.pdfGröße: 915.66 KBDownloads: 179
Datum
2013
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Working Paper/Technical Report
Publikationsstatus
Published
Erschienen in
Zusammenfassung

In the present paper the authors study second-order elliptic parametric partial differential equations, where the Parameters are scalars or distributed functions. By utilizing a modified greedy algorithm a reduced-basis approximation is derived. This new strategy combines the classical greedy algorithm with techniques from PDE constrained optimization. Numerical examples for the Graetz problem illustrate the efficiency of the strategy to handle not only scalar, but also distributed parameter functions.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690IAPICHINO, Laura, Stefan VOLKWEIN, 2013. Greedy sampling of distributed parameters in the reduced-basis method by numerical optimization
BibTex
@techreport{Iapichino2013Greed-22838,
  year={2013},
  series={Konstanzer Schriften in Mathematik},
  title={Greedy sampling of distributed parameters in the reduced-basis method by numerical optimization},
  number={315},
  author={Iapichino, Laura and Volkwein, Stefan}
}
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/22838">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Greedy sampling of distributed parameters in the reduced-basis method by numerical optimization</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22838/1/Iapichino_Volkwein_315.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22838/1/Iapichino_Volkwein_315.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-06T09:46:54Z</dc:date>
    <dc:creator>Volkwein, Stefan</dc:creator>
    <dc:language>eng</dc:language>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-06T09:46:54Z</dcterms:available>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Iapichino, Laura</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:contributor>Volkwein, Stefan</dc:contributor>
    <dc:contributor>Iapichino, Laura</dc:contributor>
    <dcterms:issued>2013</dcterms:issued>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22838"/>
    <dcterms:abstract xml:lang="eng">In the present paper the authors study second-order elliptic parametric partial differential equations, where the Parameters are scalars or distributed functions. By utilizing a modified greedy algorithm a reduced-basis approximation is derived. This new strategy combines the classical greedy algorithm with techniques from PDE constrained optimization. Numerical examples for the Graetz problem illustrate the efficiency of the strategy to handle not only scalar, but also distributed parameter functions.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen