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

推荐订阅源

J
Java Code Geeks
Jina AI
Jina AI
小众软件
小众软件
WordPress大学
WordPress大学
Last Week in AI
Last Week in AI
美团技术团队
V
V2EX
酷 壳 – CoolShell
酷 壳 – CoolShell
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - 聂微东
博客园 - 【当耐特】
人人都是产品经理
人人都是产品经理
雷峰网
雷峰网
博客园 - 司徒正美
量子位
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
宝玉的分享
宝玉的分享
月光博客
月光博客
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
大猫的无限游戏
大猫的无限游戏
T
Tailwind CSS Blog
博客园 - Franky

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
Projection-Based Reconstruction for Achieving High-Order ...
[Submitted on 22 Jun 2026] · 2026-06-23 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:High-order discontinuous Galerkin spectral element methods (DGSEM) based on Legendre-Gauss-Lobatto (LGL) nodes provide accurate and efficient discretizations for conservation laws. However, their cost, memory footprint, and time-step restrictions increase rapidly when the degree of the polynomial increases. This paper develops a corrected $\mathbb{P}_n\mathbb{P}_m$ ($c\mathbb{P}_n\mathbb{P}_m$) approach for DGSEM-LGL discretizations that aims to recover the accuracy of an $m^{th}$-order approximation while evolving only the degrees of freedom associated with an $n^{th}$-order representation, with $n<m$. The projected evolution of the high-order components is derived first at the continuous level and then in the fully discrete DGSEM-LGL setting. The discrete analysis shows that because LGL quadrature is not exact for the highest Legendre mode, a correction term for that mode is required to preserve the order of convergence. A compact projection-based reconstruction operator is then introduced to recover high-order components without solving the enlarged constrained least-squares systems used in standard reconstruction procedures. For sufficiently smooth solutions, the resulting $c\mathbb{P}_n\mathbb{P}_m$ scheme is shown to achieve the expected $m+1^{th}$ convergence order. Numerical experiments for one- and two-dimensional conservation laws, including Euler, viscous Burgers, and 2D decaying homogeneous isotropic turbulence, confirm theoretical convergence behavior and demonstrate competitive accuracy relative to computational cost, with particularly clear efficiency gains for viscous flows.

Submission history

From: Xukun Wang [view email]
[v1] Mon, 22 Jun 2026 15:53:26 UTC (14,800 KB)