Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2310.01713v1

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2310.01713v1 (math)
[Submitted on 3 Oct 2023 (this version) , latest version 23 Jul 2024 (v2) ]

Title: Greedy invariant-domain preserving approximation for hyperbolic systems

Title: 贪婪不变域保持近似用于双曲系统

Authors:Jean-Luc Guermond, Matthias Maier, Bojan Popov, Laura Saavedra, Ignacio Tomas
Abstract: The paper focuses on invariant-domain preserving approximations of hyperbolic systems. We propose a new way to estimate the artificial viscosity that has to be added to make explicit, conservative, consistent numerical methods invariant-domain preserving and entropy inequality compliant. Instead of computing an upper bound on the maximum wave speed in Riemann problems, we estimate a minimum wave speed in the said Riemann problems such that the approximation satisfies predefined invariant-domain properties and predefined entropy inequalities. This technique eliminates non-essential fast waves from the construction of the artificial viscosity, while preserving pre-assigned invariant-domain properties and entropy inequalities.
Abstract: 本文专注于双曲系统的不变域保持近似。 我们提出了一种新的方法来估计必须添加的人工粘性,以使显式、保守、一致的数值方法保持不变域并符合熵不等式。 而不是计算黎曼问题中最大波速的上界,我们估计了所述黎曼问题中的最小波速,使得近似满足预定义的不变域性质和预定义的熵不等式。 该技术消除了构造人工粘性中的非必要快波,同时保持预设的不变域性质和熵不等式。
Subjects: Numerical Analysis (math.NA)
MSC classes: 35L65, 65M60, 65M12, 65N30
Cite as: arXiv:2310.01713 [math.NA]
  (or arXiv:2310.01713v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2310.01713
arXiv-issued DOI via DataCite

Submission history

From: Matthias Maier [view email]
[v1] Tue, 3 Oct 2023 00:55:10 UTC (535 KB)
[v2] Tue, 23 Jul 2024 11:45:48 UTC (861 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2023-10
Change to browse by:
cs
cs.NA
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号