惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
S
SegmentFault 最新的问题
Engineering at Meta
Engineering at Meta
量子位
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Google DeepMind News
Google DeepMind News
博客园_首页
云风的 BLOG
云风的 BLOG
月光博客
月光博客
I
InfoQ
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Vercel News
Vercel News
美团技术团队
Microsoft Security Blog
Microsoft Security Blog
P
Proofpoint News Feed
D
Docker
F
Fortinet All Blogs
N
Netflix TechBlog - Medium
博客园 - 叶小钗
Martin Fowler
Martin Fowler
雷峰网
雷峰网
酷 壳 – CoolShell
酷 壳 – CoolShell
J
Java Code Geeks
Microsoft Azure Blog
Microsoft Azure Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Theory and internal structure of ADER-DG method for parti...
[Submitted on 14 Jun 2026] · 2026-06-17 · via math updates on arXiv.org

Physics > Fluid Dynamics

arXiv:2606.17100 (physics)

[Submitted on 14 Jun 2026]

View PDF

Abstract:Highly accurate stability boundary values for the ADER-DG method are obtained for arbitrary degrees $N$ of basis polynomials. In the linear case, stability is violated precisely when one of the matrix eigenvalues reaches $\lambda = -1$, regardless of the phase $\theta$. A rigorous mathematical framework for the stability is developed. The stability condition is significantly simplified, reducing it to the problem of calculating the roots of polynomials in the Courant number $\mathrm{CFL}$. The maximum of the Courant numbers $\mathrm{CFL}_{\rm max}(N)$ are calculated. These results are new and very convenient for practical use. A comparison of the obtained results with existing results reveals differences that may be significant for the selection of calculation parameters, especially for high degrees $N$. It is shown that widely used existing estimates $\mathrm{CFL}_{\rm max}(N) \propto 1/(2N+1)$ are overestimated. An interesting qualitative asymptotic $\mathrm{CFL}_{\rm max}(N) \propto (N+1)^{2}$ is obtained. A rigorous direct proof of the approximation is presented. Approximation orders $p = N+1$ for arbitrary degrees $N$ are rigorously derived. A set of numerical experiments is carried out to apply the ADER-DG method to solving both a linear advection equation and an Euler system of equations. The results obtained in these calculations confirm the theoretical results well. In particular, an excess of the Courant number over the $\mathrm{CFL}_{\rm max}(N)$ by even 1% in the linear case immediately leads to significant instability of the numerical solution. The obtained estimates of the boundary Courant number in the nonlinear case are somewhat underestimated -- by no more than 5%, which is due to the diffusivity and stability of the approximate Riemann solver. Empirical convergence orders are obtained, which are in good agreement with the theoretical results.
Comments: 37 pages, 10 figures, 7 tables
Subjects: Fluid Dynamics (physics.flu-dyn); Analysis of PDEs (math.AP); Numerical Analysis (math.NA); Applied Physics (physics.app-ph); Computational Physics (physics.comp-ph)
Cite as: arXiv:2606.17100 [physics.flu-dyn]
  (or arXiv:2606.17100v1 [physics.flu-dyn] for this version)
  https://doi.org/10.48550/arXiv.2606.17100

arXiv-issued DOI via DataCite

Submission history

From: Ivan Popov Ph.D. [view email]
[v1] Sun, 14 Jun 2026 06:00:07 UTC (34,073 KB)

Current browse context:

physics.flu-dyn

Bookmark

BibSonomy Reddit

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Code, Data, Media

Code, Data and Media Associated with this Article

Demos

Demos

Related Papers

Recommenders and Search Tools

About arXivLabs

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.