This work studies a norm-linearization scheme for networked systems with linear continuity constraints and nonlinear quadratic or power-law energy balances, and implements dynamic sign partitioning in a FlowDEQ layer using a reduced incidence matrix and implicit-function adjoint differentiation.
Abstract
Integrating physical conservation laws into deep neural architectures remains a central SciML challenge. Soft-penalty approaches, including many PINNs, may be sensitive to loss weighting and optimization; generic DEQ and implicit-layer solvers may require instance-dependent iteration counts. We study a norm-linearization scheme for networked systems with linear continuity constraints and nonlinear quadratic or power-law energy balances. We derive sharp universal and finite-$n$ bounds on relative variance and, via the weighted Kantorovich inequality, relate them to worst-case single-step squared-norm distortion when target and operating states have a bounded multiplicative ratio. Euler's theorem shows that the scheme is Newton's method for degree-one norm differences $u_i(\mathbf{x})-v_i(\mathbf{x})=0$. Recasting raw degree-$\alpha$ balances as norm differences removes radial curvature, yields a degree-zero homogeneous Jacobian, eliminates the affine Newton term, and row-equilibrates the loop Jacobian at equilibrium. Under regularity and nonsingularity assumptions, this gives local quadratic convergence for Darcy-Weisbach ($\alpha=2$) and Hazen-Williams ($\alpha=1.852$) models. We implement dynamic sign partitioning in a FlowDEQ layer using a reduced incidence matrix and implicit-function adjoint differentiation.
Neural networks are commonly used to learn the solution operators of PDEs such as the Navier-Stokes equations and viscous conservation laws. On standard benchmarks, moderately sized and often shallow networks achieve small errors that decay at algebraic rates with the network size. These observations are not well descr...
This work uses the semiconcavity of the viscosity solution to build a mesh-free finite-difference test that needs only forward network evaluations and detects the folded solutions and the harmful min-of-charts failures without access to the exact value function.
Raúl Jiménez, Pablo Tejerina-Pérez, Leonid Sarieddine et al.· 0 citations
Autoregressive neural operators approximate time-dependent PDE solvers by repeatedly composing a learned transition, although the resulting states need not remain feasible under the discrete constraints of the numerical problem. We study this issue for incompressible flow, where each velocity state must satisfy solver-...
Nan-Nan Zhou, Guan-Meng Xian, Ning Yang· 0 citations
This paper presents a locally conservative Enriched Linearized Neural Network (ENN) method for the Darcy flow model. A linearized shallow ReLU$^k$ network, whose hidden-layer parameters are fixed on a quasi-uniform set of the sphere, carries the approximation, and piecewise constant functions on an auxiliary subdivisio...
S. Kim, Gwanghyun Jo, Young-Ju Lee· 1 citation· ⚡1
Accurate learning-based solvers for coupled reaction–diffusion systems should preserve mathematical structure rather than merely reduce pointwise residuals. We develop a structure-preserving deep Galerkin method that combines weak residual minimization with positivity, mass-balance, and energy-dissipation constraints....
Xin-Rui Li, Yu-Heng Li· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.