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

推荐订阅源

H
Hackread – Cybersecurity News, Data Breaches, AI and More
G
Google Developers Blog
The GitHub Blog
The GitHub Blog
Jina AI
Jina AI
A
About on SuperTechFans
MongoDB | Blog
MongoDB | Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园_首页
Blog — PlanetScale
Blog — PlanetScale
酷 壳 – CoolShell
酷 壳 – CoolShell
Google DeepMind News
Google DeepMind News
D
DataBreaches.Net
B
Blog RSS Feed
大猫的无限游戏
大猫的无限游戏
美团技术团队
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
L
LangChain Blog
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
腾讯CDC
Hugging Face - Blog
Hugging Face - Blog
阮一峰的网络日志
阮一峰的网络日志
H
Help Net Security
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻

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
General Framework and Error Estimates for ROM-accelerated...
[Submitted on 26 Sep 2025 (v1), last revised 16 Jun 2026 (this v · 2026-06-18 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Whether it is for solving nonlinear equations, optimization problems, or autonomous dynamical systems, fixed-point-type iterations are widely used in numerical sciences. On-the-fly reduced-order modelling (ROM) enables the construction of a low-dimensional, self-correcting approximation of the solution to this system during the iterative process, while removing the need to do an offline training phase and any dependence on a precomputed reduced basis (e.g., a fixed geometry or mesh). This technique has been used in specific fields before, including fluid-structure interactions and topology optimization, but no general study of this method has been done to the knowledge of the authors. A general method for accelerating fixed point schemes will be presented. We show that when the iteration mapping is contractive, the error of the approximate solution is guaranteed to be within the user-defined tolerance using inexact fixed-point theory. This methodology is then applied to the solution of systems of PDEs with a block Gauss-Seidel scheme. Errors due to the ROM are propagated through each iteration with respect to the computational graph of the system, which allows one to estimate whether the current iteration is still within the user-defined tolerance. Some working hypotheses necessary to observe a significant speedup and the limitations of the method are explored as well. As a numerical illustration, the methodology is applied to a multiphysics lid-driven cavity flow in two and three dimensions.

Submission history

From: Philippe-André Luneau [view email]
[v1] Fri, 26 Sep 2025 18:56:45 UTC (626 KB)
[v2] Thu, 27 Nov 2025 16:51:27 UTC (643 KB)
[v3] Tue, 16 Jun 2026 20:50:12 UTC (3,380 KB)