Searcharxiv⌕ Search

arXiv · 2611.02977

Information Limits for Stable Reduction of Coupled Diffusion Systems

Abstract

Eliminating an unresolved diffusion field from a coupled parabolic system produces an operator-valued memory term and a contribution from the hidden initial state. We study whether a reduced prediction of the retained field meets a prescribed tolerance. For known hidden initial data, the discarded response, damped by diffusion and transmitted through the coupling, gives an upper error bound; an auxiliary diffusion problem supplies a lower bound. Rigorous discretisation bounds then yield tests that accept, reject or remain undecided. If the discarded initial state is known only through a norm bound, the minimum worst-case error equals that bound multiplied by the time-uniform gain from the missing state to the retained trajectory. Our main result encloses this infinite-dimensional gain using a finite spectral Galerkin evolution, its residual in the full equations and an explicit diffusion tail. The enclosure converges without compactness or smallness of the coupling. Strict comparisons of the optimal radius with a tolerance have finite certificates if all endpoint quantities admit arbitrarily accurate rigorous enclosures. Multiplication-coupling examples with infinitely many dynamically coupled modes illustrate both settings, including explicit finite-element error budgets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroki Ishizaka. 2026-11-02. Information Limits for Stable Reduction of Coupled Diffusion Systems. https://arxiv.org/abs/2611.02977

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Extracting Dual Analytic Geometries of Linear Transformations to Achieve Efficient Computation

We generalize the Calderon-Zygmund methodology for operator analysis and the Rokhlin-Greengard fast multipole algorithms, in which the domain and range of an operator are jointly organized. Our methods analyze unstructured kernels by uncovering the joint hidden geometries of their domain and range. The main tool is the Questionnaire algorithm, an iterative procedure that constructs adaptive bi-hierarchical partition trees that reveal latent multiscale organization and local low-rank structure in the kernel. When the geometry is unknown, the iteration starts from any initial affinity, even a random one, and, with a stochastic flip perturbation and a spectral space-filling curve that fixes the left-right order of every tree, reorganizes the matrix into an image of the operator's "phase space": the joint space of its sources and sensors, in duality, as positions and frequencies are for the Fourier transform. This ordering gives the phase space an analytic structure on which any classical transform can be carried out; the resulting compression is direct evidence of that structure. Guided by these geometries, we obtain efficient factorizations and fast matrix-vector products in two ways: (1) the Butterfly algorithm, which exploits the learned bi-hierarchical localized low-rank structure; and (2) the adaptive eGHWT, which selects best tilings in space and sequency from all levels of generalized Haar-Walsh wavelet packets. We call the resulting algorithms the Questionnaire Factorization and Fast Transform (QFFT). Unlike classical approaches requiring prior knowledge of the geometry, QFFT is fully data-driven and applies to matrices from irregular or unknown distributions. We demonstrate it on heterogeneous oscillatory operators and on orthogonal eigenvector expansions with high multiplicity and random sampling, reducing storage from O(N^2) to O(N log N) and enabling fast, scalable computation.

math.NA↗

Decoupled energy-stable Runge-Kutta schemes of arbitrary order for the anisotropic phase-field dendritic crystal growth model

This paper introduces a novel and general framework for constructing arbitrary-order, energy-stable, and decoupled schemes for the anisotropic phase-field dendritic crystal growth model. The proposed framework combines a time-dependent auxiliary variable, an algebraically stable Runge-Kutta method, and a matrix diagonalization technique. This unique combination yields a scheme that is proven to be unconditionally energy-dissipative while requiring only the solution of independent, constant-coefficient elliptic equations at each time step, which can be solved in parallel. The auxiliary variable is recovered from a uniquely solvable $q\times q$ algebraic system. We provide a rigorous proof of $q$th-order convergence in time for a $q$-stage Runge-Kutta method within a fixed Fourier-Galerkin space. Numerical experiments in 2D and 3D not only confirm the theoretical convergence and energy stability but also demonstrate the efficiency of the decoupled approach and provide a detailed investigation of key parameters' effects on dendritic morphology.

math.NA↗

Automated Numerical Stability Analysis of Deep Learning Operators

Finite-precision arithmetic unavoidably introduces numerical approximation errors. Numerical computations may use insufficient precision or an improper formulation, which leads to numerical instability. In this paper, we introduce a unified software tool for stochastic numerical validation of deep-learning operators. The tool follows CESTAC on supported exposed operations and uses an operator-level data-perturbation approximation for GEMM-like kernels. Our developed software not only enables numerical validation with a single computation pass but also detects the sources of numerical instability and provides numerical stability monitoring during deep learning training and inference. We verified its effectiveness on the detection of polluted operators with injected numerical instabilities across various tasks. We believe that our developed method and tools provide valuable insights into developing numerically stable computing kernels, which are particularly critical for numerically stable and efficient deep learning training and inference.

math.NA↗