About: Computational aspects of the mesh adaptation for the time marching procedure     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Příspěvek se věnuje konstrukci adaptivní výpočtové sítě v kombinaci s metodou konečných objemů. Výsledná strategie je určena pro numerické řešení problémů popsaných pomocí hyperbolických PDR. Hlavní pozornost věnujeme zákonu zachování po každém z adaptivních kroků. Jako adaptivní metodu používáme anisotropní adaptivitu. Výsledný algoritmus je formulován jako N-dimensionální a je vhodný pro řešení problémů s pohybující se nespojitostí. Součástí příspěvku je též ukázka numerické simulace. (cs)
  • The paper deals with a construction of an adaptive mesh in the framework of the cell-centred finite volume scheme. The adaptive strategy is applied to the numerical solution of problems governed by hyperbolic partial differential equations. Starting from the adaptation techniques for the stationary problems (for a general overview see e.g. [9]), the nonstationary case is studied. The main attention is paid to an adaptive part of a time marching procedure. The main feature of the proposed method is to keep the mass conservation of the numerical solution at each adaptation step. We apply an anisotropic mesh adaptation from [1]. This is followed by a recovery of the approximate solution on the new mesh satisfying the geometric conservation law. The adaptation algorithm is formulated in the framework of an N-dimensional numerical solution procedure. A new strategy for moving a vertex of the mesh, based on a gradient method, is presented. The results from [4] are further developed. The general significance
  • The paper deals with a construction of an adaptive mesh in the framework of the cell-centred finite volume scheme. The adaptive strategy is applied to the numerical solution of problems governed by hyperbolic partial differential equations. Starting from the adaptation techniques for the stationary problems (for a general overview see e.g. [9]), the nonstationary case is studied. The main attention is paid to an adaptive part of a time marching procedure. The main feature of the proposed method is to keep the mass conservation of the numerical solution at each adaptation step. We apply an anisotropic mesh adaptation from [1]. This is followed by a recovery of the approximate solution on the new mesh satisfying the geometric conservation law. The adaptation algorithm is formulated in the framework of an N-dimensional numerical solution procedure. A new strategy for moving a vertex of the mesh, based on a gradient method, is presented. The results from [4] are further developed. The general significance (en)
Title
  • Computational aspects of the mesh adaptation for the time marching procedure
  • Výpočetní aspekty adaptace výpočtové sítě pro time marching procedure (cs)
  • Computational aspects of the mesh adaptation for the time marching procedure (en)
skos:prefLabel
  • Computational aspects of the mesh adaptation for the time marching procedure
  • Výpočetní aspekty adaptace výpočtové sítě pro time marching procedure (cs)
  • Computational aspects of the mesh adaptation for the time marching procedure (en)
skos:notation
  • RIV/44555601:13440/06:00004264!RIV09-MSM-13440___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 469461
http://linked.open...ai/riv/idVysledku
  • RIV/44555601:13440/06:00004264
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • adaptive mesh; finite volume scheme; geometric conservation law (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [A6DE6A7921C1]
http://linked.open...v/mistoKonaniAkce
  • Santiago de Compostela
http://linked.open...i/riv/mistoVydani
  • BERLIN
http://linked.open...i/riv/nazevZdroje
  • Numerical Mathematics and Advanced Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Felcman, Jiří
  • Kubera, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000242968100015
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • SPRINGER-VERLAG
https://schema.org/isbn
  • 3-540-34287-7
http://localhost/t...ganizacniJednotka
  • 13440
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software