Publikation: Do Finite Volume Methods Need a Mesh?
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
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
In this article, finite volume discretizations of hyperbolic conservation laws are considered, where the usual triangulation is replaced by a partition of unity on the computational domain. In some sense, the finite volumes in this approach are not disjoint but are overlapping with their neighbors. This property can be useful in problems with time dependent geometries: while the movement of grid nodes can have unpleasant effects on the grid topology, the meshfree partition of unity approach is more flexible since the finite volumes can arbitrarily move on top of each other. In the presented approach, the algorithms of classical and meshfree finite volume method are identical - only the geometrical coefficients (cell volumes, cell surfaces, cell normal vectors) have to be defined differently. We will discuss two such definitions which satisfy certain stability conditions.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
JUNK, Michael, 2003. Do Finite Volume Methods Need a Mesh?. In: GRIEBEL, Michael, ed., Marc Alexander SCHWEITZER, ed.. Meshfree Methods for Partial Differential Equations. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 223-238. Lecture Notes in Computational Science and Engineering. 26. ISBN 978-3-540-43891-5. Available under: doi: 10.1007/978-3-642-56103-0_15BibTex
@incollection{Junk2003Finit-25427, year={2003}, doi={10.1007/978-3-642-56103-0_15}, title={Do Finite Volume Methods Need a Mesh?}, number={26}, isbn={978-3-540-43891-5}, publisher={Springer Berlin Heidelberg}, address={Berlin, Heidelberg}, series={Lecture Notes in Computational Science and Engineering}, booktitle={Meshfree Methods for Partial Differential Equations}, pages={223--238}, editor={Griebel, Michael and Schweitzer, Marc Alexander}, author={Junk, Michael} }
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/25427"> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Junk, Michael</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25427"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-12-20T08:20:18Z</dcterms:available> <dcterms:bibliographicCitation>Meshfree methods for partial differential equations / Michael Griebel ... (eds.). - Berlin [u.a.] : Springer, 2002. - S. 223-238. - (Lecture notes in computational science and engineering ; 26). - ISBN 978-3-540-43891-5</dcterms:bibliographicCitation> <dcterms:issued>2003</dcterms:issued> <dcterms:abstract xml:lang="eng">In this article, finite volume discretizations of hyperbolic conservation laws are considered, where the usual triangulation is replaced by a partition of unity on the computational domain. In some sense, the finite volumes in this approach are not disjoint but are overlapping with their neighbors. This property can be useful in problems with time dependent geometries: while the movement of grid nodes can have unpleasant effects on the grid topology, the meshfree partition of unity approach is more flexible since the finite volumes can arbitrarily move on top of each other. In the presented approach, the algorithms of classical and meshfree finite volume method are identical - only the geometrical coefficients (cell volumes, cell surfaces, cell normal vectors) have to be defined differently. We will discuss two such definitions which satisfy certain stability conditions.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-12-20T08:20:18Z</dc:date> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Do Finite Volume Methods Need a Mesh?</dcterms:title> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Junk, Michael</dc:contributor> </rdf:Description> </rdf:RDF>