Papers

Images are important tools in various sciences. Despite the development of photo-taking tools, creating clear and image without noise remains challenging in practice. In particular, Poisson noise has an effect on medical and astronomical images, and reduces their quality. Additionally, blur is another factor that has an effect on image quality. The problem of image restoration becomes very complicated when we have no information about the Point Spread Function (PSF). These types of problems are known as blind case. However, in some images, such as some astronomical images, the type of PSF can be specified, and these types of problems are known as nonblind problems. Total Variation (TV) is a widely used method for solving such inverse problems, where the selection of the penalty function is the most critical factor that affects the method's performance. In this paper, to improve edge preservation, we employ a reweighted $\ell_1$-regularization of the fractional order derivative. Furthermore, we propose a nonblind and blind image deblurring approach under Poisson noise using the Minimax Concave Penalty (MCP), which is a continuous, sparsity promoting, and nearly unbiased regularizer. This formulation leads to a nonconvex optimization model. To solve the proposed model, we introduce an efficient numerical algorithm based on the Alternating Direction Method of Multipliers (ADMM) and provide an analysis of its convergence. Finally, the effectiveness of the proposed algorithm are demonstrated through extensive experiments on various images.

We propose Local Chebyshev Cross-Approximation (LoCCA), a data-driven framework that bridges smooth polynomial interpolation with flexible matrix factorizations. LoCCA dynamically maps ideal grid nodes to their nearest physical neighbors within unstructured point sets. We support this framework with a new perturbation theory, proving that displacing Chebyshev nodes onto physical data points retains mathematical stability and accuracy without explosive error growth. Numerically, LoCCA provides strict, reliable error control even on irregular geometries where standard grid-based methods fail, achieving substantial speedups and near-optimal matrix compression.

We study the high-dimensional asymptotics of Harish-Chandra-Itzykson-Zuber (HCIZ) integrals in the extensive-rank regime. The limit of these integrals is governed by a one-dimensional boundary-value hydrodynamical problem originally derived by Matytsin (1994) and rigorously proved by Guionnet and Zeitouni (2002). Despite its wide-ranging applications, explicit solutions to this problem are known only in a few specific cases. In this work, we introduce an efficient numerical scheme based on a particle discretization and prove its convergence to the continuous boundary-value problem for generic boundary densities. We validate our approach against known analytical solutions and apply it to generic densities, uncovering interesting dynamical phenomena. The high-dimensional limit of HCIZ integrals appears in various contexts, from the large deviations of random matrix spectra to the limiting free energy of disordered systems, high-dimensional statistics, and machine learning. As such, our contribution opens the way towards the numerical exploration of a wide range of high-dimensional models that were previously intractable.

Classical approximation methods are usually improved by changing the sampling set, increasing the number of data points, or selecting a different basis. We advocate a complementary viewpoint: keep the sampled values fixed and modify the representation through a suitable mapping. This viewpoint unifies several constructions that were originally introduced for different purposes. Rescaled radial basis function interpolation maps the interpolation operator through a normalization that enforces exact reproduction of constants. Variably scaled kernels map the geometry by lifting the data to a higherdimensional manifold determined by a scale function. Mapped bases and fake nodes map the approximation space without resampling the data, while rational kernel expansions can be interpreted as nonlinear mappings of the trial space. We develop a common notation for these mechanisms, summarize their approximation and stability properties, and explain how discontinuous and rational variants fit the same framework. Reproducible numerical experiments illustrate constant reproduction, error reduction through data-mimicking scale functions, and the suppression of the Runge phenomenon by mapped polynomial bases. The results support a general principle: mappings provide a flexible way to adapt approximation spaces to data geometry and regularity without modifying the original observations

Extrusion-based 3D concrete printing builds structural elements layer upon layer without formwork, so freshly deposited material must carry the growing weight of the structure while it is still gaining strength and stiffness. The largest number of layers that can be printed before failure, the buildability, is therefore central to process design. Its prediction rests above all on how accurately the constitutive model represents fresh concrete. Existing finite element frameworks pair gradual pre-failure hardening only with smooth yield surfaces, which leaves the Mohr-Coulomb surface that best describes fresh concrete restricted to perfect plasticity. This work combines a smoothed Mohr-Coulomb yield surface with nonlinear isotropic hardening of the cohesion, formulated in an updated Lagrangian setting with an activation field for layer deposition. Failure is identified from a tangent-stiffness eigenvalue criterion that matches the analytical self-weight buckling load of a slender wall and is insensitive to geometric imperfection. The framework reproduces the measured collapse of a printed straight wall within one layer and predicts the collapse of a hollow cylinder closer to experiment than existing frameworks. A study over six diameters and six hardening rates shows buildability peaking at intermediate diameters and rising with the hardening rate. Recording how much of its strength the material has used at failure, slender cylinders fail with much still in reserve while intermediate ones use nearly all of it. The two failure modes are therefore identified as the limits of one process rather than separate failure mechanisms.

The paper is concerned with the numerical approximation of some two-dimensional asymptotic models for the propagation of internal waves in a two-layer system in the form of pde's for the interfacial deviation and the velocity. After the study of well-posedness of the periodic initial-value problem, the convergence of a semidiscrete approximation based on a spectral Fourier-Galerkin method is analyzed. The resulting semidiscrete system is then integrated numerically in time with the implicit midpoint rule. Some properties of the fully discrete scheme are described and its performance is illustrated with some numerical experiments.

Recently, increasing attention has been paid to finite element discretizations of vector-valued flow problems posed on curved surfaces. In this work, we study a surface Stokes system defined on a two-dimensional manifold embedded in three-dimensional space. The surface velocity field is approximated using a nonconforming Crouzeix-Raviart finite element on a polyhedral approximation of the surface, while the pressure is discretized by piecewise constant functions. The governing equations involve the symmetric strain-rate tensor, whose approximation with Crouzeix-Raviart finite elements leads to spurious oscillations in the velocity field because the discrete Korn inequality fails on the nonconforming space. We therefore stabilize the momentum equation by adding an edge-jump penalty term, which restores the coervity of the bilinear term as the discrete Korn inequality holds for this stabilized version. Additionally, we establish that this finite element pair of velocity and pressure spaces satisfies the discrete inf-sup compatibility condition. Furthermore, we derive optimal a-priori error estimates in both the energy norm and the $L^2$-norm. These theoretical results are corroborated by numerical experiments.

Writing error-free floating-point programs is a challenging task, especially for programmers who lack a strong background in numerical analysis and rounding-error propagation. State-of-the-art techniques typically aim to bound such errors using static or dynamic analysis. However, only a few tools explicitly address critical floating-point pitfalls such as absorption and catastrophic cancellation. These anomalies represent situations in which rounding errors are significantly amplified, causing the semantics of the finite-precision computation to deviate substantially from the real-number semantics. In this article, we present FPScan, a novel tool to formally define and detect both catastrophic cancellation and absorption in floating-point programs. Our approach starts with a custom static analyzer based on abstract interpretation to infer the order of magnitude of all program variables. This magnitude information is then used to build a set of first-order constraints that model error propagation and numerical precision within the program. Finally, we employ an off-the-shelf SMT solver to determine whether the program exhibits any of these critical numerical pitfalls. Experiments were conducted on FPBench, a well-known benchmark suite of floating-point programs, to evaluate the effectiveness of our tool. We also present a comparison with state-of-the-art tools regarding soundness and analysis time.

This work presents a comparative analysis of Reduced-Order Models (ROMs) applied to incompressible fluid dynamics within geometrically parametrized domains. Two distinct reduced-order solution strategies are investigated and compared: a monolithic coupled solver and a segregated SIMPLE-based algorithm. Their performance is assessed on two steady, two-dimensional benchmark cases: a lid-driven cavity flow and a flow past a cylindrical obstacle. The two algorithms are compared in terms of fields evaluation and aerodynamic coefficients prediction. The computational results highlight a fundamental trade-off between accuracy and numerical efficiency. On the one hand, after an opportune supremizers enrichment, the coupled approach guarantees a faster convergence, despite the need of a larger number of degrees of freedom. On the other hand, the segregated SIMPLE algorithm yields superior reconstruction accuracy, particularly for lower-dimensional reduced spaces, at the cost of a slower convergence rate.

Physics-informed neural networks (PINNs) represent a growing frontier in using artificial intelligence to solve partial differential equations (PDEs). Automatic differentiation (AD) plays a central role in this paradigm, which is mesh-free and replaces traditional iterative solvers with gradient-based optimization in continuous space. However, the inherent limitations of AD, particularly in handling higher-order derivatives and discontinuous solutions, pose significant challenges for complex problems. This has motivated a growing number of researchers to explore discretization-based constraints as an alternative path. Yet, the respective applicability of these two paradigms remains largely unexplored. In this work, we conduct systematic experiments across a wide spectrum of problems, from simple linear Poisson to high-Mach hypersonic flows with strong discontinuities. Through a rigorous decomposition of approximation, optimization, and truncation errors, we systematically elucidate the fundamental trade-offs and error-governing mechanisms of both paradigms, as well as two representative network architectures: multi-layer perceptron (MLP) and graph neural network (GNN). Our results reveal a consistent trend: as nonlinearity strengthens, the accuracy advantage of discretization-based constraints becomes increasingly pronounced, with smaller optimization errors compensating for the truncation errors. Moreover, the more complex the nonlinearity and boundary conditions, the greater the advantage of GNN over MLP. These insights offer a robust practical guideline for configuring neural PDE solvers in demanding engineering applications. Our source data and code are available at https://github.com/guoxing0809/neuropde_analysis.

This paper establishes the fully discrete stochastic maximal $L^p$-regularity and the accompanying sharp maximal estimate for numerical approximations of parabolic stochastic partial differential equations. We consider the spatial finite element discretization $A_h$ of a general second-order elliptic operator $A=-\nabla \cdot a\nabla +b\cdot \nabla +c$ with Dirichlet boundary conditions on a smooth, bounded, convex domain in $\mathbb{R}^3$, coupled with a broad class of temporal schemes, including rational approximations and the exponential Euler method. To obtain these optimal discrete regularity results, we establish a bounded $H^\infty$-calculus for the discrete spatial operator $A_h$, uniformly in the mesh size $h$. As a direct byproduct, we also establish the discrete-in-space stochastic maximal regularity for the corresponding spatial semi-discretizations. As an application, we establish the pathwise uniform convergence of a fully discrete approximation of the three-dimensional stochastic Allen–Cahn equation with variable diffusion coefficients and multiplicative noise.

We present a frequency-domain formulation of Biot's dynamic poroelastic equations with frequency-dependent dissipation (Biot–Allard) for anisotropic, heterogeneous media with memory effects. Two equivalent two-field representations–a displacement-pressure and a velocity-pressure-rate formulation–enable stabilized iterative splitting. While coupling operators generally lack an adjoint or skew-adjoint relationship at finite frequencies, the velocity–pressure-rate representation restores a skew-adjoint structure in the quasi-static limit. We prove continuity of the coupling operators and coercivity of the diagonal blocks, essential for convergence of the L-stabilized splitting scheme. The frequency-domain setting eliminates convolutional memory terms, incorporates attenuation and dispersion via complex-valued parameters, and reduces the time-dependent problem to a family of elliptic boundary-value problems suited for parallel computation and multi-frequency inversion. A conforming Galerkin finite element discretization preserves block structure, and numerical experiments confirm robustness and capture frequency-dependent attenuation. To illustrate discretization independence, we include a large-scale wave simulation using a pseudo-spectral method. This work provides a rigorous and efficient framework for modeling wave phenomena in complex porous media.

In computational fluid dynamics, the numerical simulation of free-surface flows using interface capturing approaches (level set, pseudo-concentration) requires accurate resolution of a transport equation. In the present work, this equation is solved using a new formulation of the Lesaint–Raviart discontinuous Galerkin method, which is particularly suitable for problems without inflow boundaries. The motion is described by the incompressible Navier–Stokes equations with surface tension, discretized using the standard $P2-P1$ Taylor–Hood finite element method in space. Surface tension effects are represented using the so-called Continuum Surface Force model. Finally, the proposed approach is implemented and tested on several benchmarks, including the single rising bubble and the Rayleigh–Taylor instability.

Data-driven constitutive models for path-dependent plasticity are commonly formulated using nonlinear recurrent neural networks, whose sequential state evolution limits parallel training and whose predictions may depend on the discretization of the applied strain path. We introduce a Constitutive State Space (CSS) model that reformulates structured state-space dynamics as an incremental constitutive operator. The strain increment is decomposed into magnitude and direction: the loading direction drives the latent state-space system, while the increment magnitude enters the zero-order-hold discretization of its continuous-time linear recurrence. This mechanics-tailored construction guarantees stationarity under zero increments, strongly reduces sensitivity to strain-path resolution, and retains the parallel-scan structure of S5 for efficient training on long constitutive histories. The CSS and Minimal State Cell (MSC) architectures are compared for four multiaxial path-dependent material models including isotropic J2 plasticity, pressure-sensitive foam plasticity, and combined isotropic-kinematic hardening. CSS matches or exceeds the prediction accuracy of the MSC, including one order of magnitude lower validation losses for the plastically incompressible materials. Importantly, CSS maintains low errors across large changes in strain-path discretization, whereas the MSC error increases substantially when evaluated at coarser resolutions than used for training. CSS trains substantially faster and requires fewer strain-stress pairs to attain comparable or better accuracy. Analysis of the learned state further reveals latent structure consistent with the dimensionality of the underlying physical constitutive models. These results establish mechanics-tailored structured state-space dynamics as a computational framework for efficient and discretization-robust data-driven constitutive modeling.

Analytic continuation of imaginary-time quantum Monte Carlo data to real-frequency spectra requires the inversion of a severely ill-posed two-sided Laplace transform and arises naturally in quantum many-body calculations of dynamic properties. In this work, we distinguish the intrinsic ill-posedness of the continuous inverse two-sided Laplace problem from the conditioning of its finite-dimensional discretization. For equidistant sampling and reconstruction grids, we express the discrete problem via a diagonally scaled monomial Vandermonde matrix with exponentially distributed nodes. Imposing the physical detailed-balance symmetry transforms the discretization into a diagonally scaled Chebyshev-Vandermonde system. Exploiting these structures, we derive explicit lower and upper bounds on the condition numbers in terms of the physical and discretization parameters. For the unconstrained discretization, our bounds reveal super-exponential growth of the condition number with the reconstruction dimension, which cannot be removed by increasing the number of imaginary-time samples alone. Detailed-balance substantially improves the conditioning, especially in the practically relevant pre-asymptotic regime, although the asymptotic super-exponential dependence remains. In both cases, our bounds identify a low-dimensional regime in which the super-exponential contribution is suppressed and stable reconstruction remains feasible. These results provide a mathematical explanation for the effectiveness of low-dimensional spectral representations and detailed-balance in analytic continuation. While they do not remove the fundamental ill-posedness, they substantially mitigate the ill-conditioning of its finite-dimensional discretization, delay the onset of its catastrophic super-exponential growth and thereby enlarge the range of numerically accessible reconstructions.

Priors in Bayesian inverse problems are often approximated through discretization, hyperparameter estimation, or generative modeling. Understanding how prior approximation errors propagate to the posterior and subsequent predictions is therefore important. In this work, we study the stability of the prior-to-posterior map where both prior and posterior perturbations are measured in the same Wasserstein metric $W_p$, $p\geq1$. We identify verifiable conditions on likelihood regularity and admissible prior classes that ensure uniform, Hölder, and Lipschitz stability. For bounded likelihoods that are uniformly continuous on bounded sets, uniform stability holds over prior classes with uniformly integrable $p$-th moments and a common positive evidence lower bound. With global Hölder regularity of the likelihood and uniform bounds on higher prior moments, a coupling argument leads to a Hölder estimate with a sharp exponent. For $p>1$, a Lipschitz likelihood need not give Lipschitz stability, even for priors with bounded support. We establish Lipschitz stability through an interpolation argument under uniform Poincaré bounds and a globally Lipschitz potential with uniformly bounded essential oscillation under the priors. For Gaussian priors with additive Gaussian noise and bounded Lipschitz forward models, these estimates give posterior $W_2$ bounds even for mutually singular prior perturbations. Numerical experiments for a Darcy inverse problem illustrate the predicted Hölder and Lipschitz rates and the resulting control of errors in the posterior mean and standard deviation of a Lipschitz quantity of interest.

We present a data-driven approach to identifying linear index-1 differential-algebraic pH systems (pH-DAEs) based on input-output measurements. In comparison to the identification of port-Hamiltonian (pH) systems, the algebraic constraint and the index condition pose additional challenges. First, we establish a structure-preserving formulation of the considered pH-DAE class and derive an implicit midpoint discretization that preserves the algebraic constraints and discrete dissipation inequality. We formulate the identification problem as a regularized least-squares minimization problem subject to the pH-DAE dynamics. Exploiting the index-1 structure, we reduce the constrained problem to an unconstrained optimization problem over the system parameters while preserving the port-Hamiltonian structure. Next, we derive an adjoint-based formulation to efficiently evaluate the gradient of the resulting reduced cost functional. This enables us to use gradient-based optimization methods for parameter estimation. Under suitable assumptions on the admissible parameter set, the existence of a minimizer is established. Numerical experiments demonstrate that the proposed approach can identify surrogate pH-DAE systems that accurately reproduce the input-output behavior of reference systems. Further investigations show the approach's potential for identifying reduced-order surrogate models. Cross-validation with independent input signals confirms the predictive capability of the identified models.

We give a \(3\times 3\) counterexample, valid over every field, to a rank-minimization conjecture of Lin and Wimmer (Bull. Aust. Math. Soc., 84 (3) (2011), 441–443) related to Roth's similarity theorem for the Sylvester matrix equation. We also prove that, over the complex field, no counterexample can occur when one of the two matrix sizes is less than \(3\). Hence the example is dimensionally minimal over the complex field.

This paper presents a physics-aware reduced-order method (ROM) for the efficient computation of wave-scattering problems. Standard model order reduction techniques, typically treating scattering as generic parameterized systems, frequently overlook the underlying physical structure, limiting their effectiveness in practice. To address this limitation, we propose an algorithmic framework that utilizes the intrinsic low-rank structure of the induced contrast source density. By modeling the incident wave as a random variable governed by a specified prior probability measure, we formulate the contrast source as a spatial random field whose covariance function captures essential spatial correlation and physical interactions. The reduced-order basis is then constructed via the Karhunen-Loève (KL) expansion, effectively extracting the dominant features from the scattering process to resolve multiple scattering scenarios. A central algorithmic contribution is the efficient reconstruction of the covariance matrix for arbitrary scatterer geometries and specified incident wave priors. To circumvent the prohibitive computational cost of assembling high-fidelity covariance matrices, we introduce a non-intrusive, physics-informed graph neural network (GNN) surrogate to learn the complex mapping from scatterer geometry to the source correlation kernel, enabling a highly efficient offline-online computational paradigm suitable for large-scale scattering configurations. Extensive numerical experiments demonstrate that the proposed framework achieves robust computational acceleration over full-order models without sacrificing accuracy.

Large plastic deformation can drive an initially uniform single crystal to spontaneously subdivide into misoriented grains separated by thin dislocation walls – a pattern-forming instability rooted in the loss of convexity of the crystal's elastic energy at large strain. We study this phenomenon for a ductile crystal in plane-strain simple shear within continuum dislocation theory, using a polyconvex (Ciarlet–Geymonat) elastic energy that guarantees existence of minimizers for the coupled deformation–slip problem. Minimizing over the plastic slip yields a condensed energy of double-well form whose non-quasiconvexity favours a lamellar microstructure; the gradient of the geometrically necessary dislocation density regularizes it, giving the grain boundaries a finite thickness and energy as functions of the misorientation angle. A block-coordinate finite element scheme – alternating a convex non-smooth solve for the slip with a Levenberg-regularized Newton solve for the deformation – resolves this microstructure numerically and detects its spontaneous onset, reproducing the lamellar grain structure in agreement with the closed-form analysis.

We propose a class of high-order fully-discrete entropy stable (ES) explicit discontinuous Galerkin (DG) solvers for the compressible ideal magnetohydrodynamics (MHD) equations. Our main theoretical contribution is the introduction of a novel generalized-path-decomposition framework for MHD equations in Godunov's symmetric form. By innovatively interpreting the interior volume integral of the non-conservative source term as a path integral along a generalized path constructed by the solution polynomial, we establish the weak cell entropy inequality for the fully-discrete DG schemes. This overarching framework also accommodates other existing DG solvers based on the symmetric form. Combined with a carefully designed ES limiter, the proposed scheme satisfies the genuine fully-discrete cell entropy inequality. With this property, a Lax–Wendroff-type theorem can be obtained to show that the solution limit satisfies the entropy condition. Finally, the scheme is naturally compatible with the locally divergence-free space. Extensive numerical experiments demonstrate the scheme's low numerical dissipation and strong robustness.

Many microfluidic and porous-media computations reduce to the same core task: solving a Stokes saddle-point system on a domain perforated by a dense periodic array of pillars, as in deterministic lateral displacement (DLD) particle sorters. After rescaling the device to unit size, the geometry is controlled by a single dimensionless parameter $m$—the number of pillars across the device, equal to the inverse period. In realistic devices $m$ reaches the hundreds or thousands, and as it grows the Stokes inf-sup constant decays like $m^{-1}$, the pressure Schur complement becomes severely ill-conditioned, and standard block solvers slow down in proportion to the pillar density. We remove this bottleneck by identifying the pressure norm that the divergence operator induces on such geometries. For periodic pillar arrays in the proportional-hole regime, we prove that this inf-sup norm is uniformly equivalent to the $L^2+\sigma_\epsilon H^1$ $K$-functional norm at the pore scale $\sigma_\epsilon\asymp\epsilon$, with constants independent of the period, the pillar count $m$, and the mesh size $h$. The equivalence identifies the perforated Stokes problem with a Brinkman problem at a homogenized permeability, and its Riesz map reduces to a pressure-mass inverse plus a scaled stiffness inverse. Combined with operator preconditioning, this yields a block preconditioner built from standard algebraic-multigrid solves whose iteration count is essentially independent of both mesh size and pillar density. Two-dimensional Taylor–Hood experiments confirm the predicted robustness in mesh refinement, pillar density, geometric scale, close packing, and time step.

We develop a numerical framework for three-dimensional quasiperiodic Maxwell eigenvalue problems obtained through a six-dimensional periodic embedding. A projected Bloch–Fourier discretization yields a structured generalized eigenvalue problem with a large gradient-type kernel. Explicit orthonormal bases for the longitudinal and transverse subspaces remove this kernel exactly and reduce the original generalized eigenvalue problem to a null-space-free standard eigenvalue problem containing only the positive spectrum. An explicit inverse representation of the reduced operator avoids nested inner–outer linear solves and leads to an inverse Lanczos method whose main inner computation is a Hermitian positive definite conjugate-gradient solve with condition number bounded by that of the mass matrix; a residual estimate quantifies the effect of inner solves on the inverse Ritz pairs. To recover the computed modes in physical space, the six-dimensional Fourier eigenvectors are reconstructed on a three-dimensional Yee grid by a separated multi-center Taylor expansion, which avoids the dense Fourier-to-grid phase matrix and remains practical when direct dense reconstruction becomes prohibitively expensive. Local weighted Rayleigh quotients provide an independent physical-space validation, and their mass-weighted expectation is proved to equal the cropped Yee Rayleigh quotient under a partition-of-unity condition. Numerical experiments confirm the accuracy and computational effectiveness of the proposed framework and its physical-space recovery of three-dimensional quasiperiodic Maxwell modes.

We develop a new low-accuracy sampler, called smoothed Picard Hamiltonian Monte Carlo, which combines Gaussian smoothing, Picard iteration, and higher-order discretization. For a log-concave target $\pi \propto \exp(-V)$ in dimension $d$ satisfying $0 \prec \alpha I \preceq \nabla^2 V \preceq \beta I$, with condition number $\kappa := \beta/\alpha$, smoothed Picard HMC returns a sample with $\sqrt \alpha\,W_2(\cdot,\pi) \le \varepsilon$ using $\widetilde O(\kappa^2 + \kappa^{7/6} d^{1/6}/\varepsilon^{1/3})$ gradient queries. We also prove stronger $W_q$ bounds, and then develop an algorithmic framework, the recursive warm start generator, to upgrade these $W_q$ bounds to stronger divergence guarantees. This produces a warm start for the proximal bouncy particle sampler, introduced in a companion work, leading to a high-accuracy log-concave sampler with complexity $\widetilde O((\kappa^{7/6} d^{1/6} + \kappa^{1/2} d^{1/4})\mathrm{polylog}(1/\varepsilon))$.

Data assimilation by nudging (also called CDA) yields exponentially decaying errors and an infinite predictability horizon if the method parameter is large enough and the observations are frequent enough in time and dense enough in space. We consider the complementary case of moderate parameters and sparse and infrequent observations. We prove that assimilation with any data and any(positive) parameter strictly decreases errors and strictly increases the (now finite) predictability horizon.

This paper presents an enhanced formulation of the Fragile Points Method (FPM), a truly meshless approach for efficiently modeling implicit interfaces in two-dimensional differential equations involving non-homogeneous materials. The proposed framework eliminates the need for specialized numerical integration techniques and provides a systematic mathematical foundation for solving interface problems. Discontinuities in both primary and secondary variables across interfaces are naturally handled through the inherently discontinuous shape functions of FPM. Unlike conventional Galerkin methods, FPM employs simple, local, point-based polynomial trial and test functions constructed via a generalized finite difference approach. These discontinuous functions bypass the continuity requirements of standard Galerkin frameworks. To address the resulting inconsistency due to discontinuities, we incorporate numerical flux corrections inspired by the discontinuous Galerkin method. The proposed method is validated through several benchmark problems, demonstrating its efficiency and robustness.

Reactive sedimentation of mixtures composed by biological and inert solid matter including liquid substrates is modelled by a system of convection-diffusion-reaction equations. In this process, the small solid particles dispersed in the viscous fluid settle due to gravity while simultaneous chemical reactions take place between solid and liquid components (substrates). Among the applications of reactive sedimentation processes, the principal use is in the simulation and control of secondary settling tanks (SSTs) in water resource recovery facilities (WRRFs). The governing equations include a nonlinear strongly degenerate parabolic equation for the total concentration of solids, and transport equations including reaction terms for the solid components and substrates. To accurately approximate the model equations, a high-order finite volume scheme is developed using polynomial reconstructions. Two reconstruction methods are used, a second-order monotonic upstream-centered scheme (MUSCL), and a third-order central weighted essentially non-oscillatory (CWENO3) method. In addition, for the time discretization, we employ strong stability preserving Runge-Kutta (SSPRK) schemes of second- and third-order. The CWENO3 scheme is complemented with limiters, and in the case of zero diffusion, the designed high-order schemes are shown to preserve an invariant-region property. This property is particularly relevant as it ensures that physically relevant numerical solutions are obtained at each time iteration. In addition, high-order approximations for the diffusion terms are proposed to approximate the complete model equations. Simulations of denitrification in SSTs under a continuously operated regime in WRRFs demonstrate the performance of the model and its discretization. Finally, convergence tests show the order of accuracy of the developed scheme and the invariant-region preservation.

Smart agriculture platforms usually bundle AI diagnosis, IoT sensing and decision push into a single package, so the green benefit attributable to each component remains unclear and resource-allocation decisions lack quantitative evidence. Building on a previous platform-level Monte Carlo assessment, this paper makes the components explicit and runs two controlled simulation experiments. Experiment 1 follows the chain from AI capability to farmer behavior to agrochemical input reduction, modeling pesticide/fertilizer reduction as avoidable blind-application share times prescription effectiveness times decision-touch coverage times adoption rate, and compares an experienced-extension mode with the AI mode: the probability of reaching 20% pesticide reduction is essentially zero in the extension mode but 20.7% at baseline, up to 49% with diagnosis accuracy 0.95 and adoption 0.85 under AI; the probability of 15% fertilizer reduction rises from near zero to 52.0%. Experiment 2 compares current practice (P0), IoT engineering retrofit (P1), and P1 plus AI irrigation scheduling (P2): median aggregate water saving rises from 7.8% (P0) to 11.0% (P1) and 16.0% (P2), with AI adding 5.0 percentage points beyond engineering; paddy CH4 reduction reaches 30.5% under AI scheduling versus 19.8% under manual operation, and the rice irrigation-methane subsystem carbon intensity declines 27.9%. Sensitivity analyses of both experiments consistently indicate that the primary bottleneck for meeting green targets is farmer adoption rather than algorithm accuracy, and that AI data fusion is robust to soil-moisture sensing errors. This work provides a reproducible simulation framework for component-level green-value evaluation and promotion-strategy optimization of smart agriculture platforms.

We introduce and analyse an arbitrary order spatial discontinuous Galerkin (dG) method for the Dean–Kawasaki equation, a highly singular SPDE modelling density fluctuations of $N$ diffusing particles in the regime of large particle number $N \gg 1$. Our starting point is a general procedure for discretising multiplicative, divergence-form noise on finite element spaces whilst preserving its cross-variation structure at the discrete level; the construction is explicit, elementwise, applies to continuous and discontinuous spaces alike, and extends to general mobilities. Using it, we prove weak error estimates of order $O(h^p)$ between fluctuations of the semi-discrete scheme and those of the underlying particle system, together with a correction that is exponentially small in the scaling regime $Nh^d \gg 1$ and arises because the scheme does not preserve positivity. The resulting method is locally and globally conservative and applies on unstructured simplicial meshes. Quantitative numerical experiments support the analysis, and further experiments illustrate the method beyond the scope of the theory: indicator function observables, external and interaction potentials, convection-dominated regimes and reflecting boundary conditions.

We study sparse Mellin spectral recovery from geometric samples. Dilation covariance is shown to generate the Hankel structure directly, rather than only after reduction to a classical exponential-sum model. For complex exponents, incommensurate sampling scales remove the logarithmic aliasing that persists at a single scale. A second recovery channel is obtained from the minimal Hankel pencil: contour winding counts spectral nodes regionally, while Rouché-type bounds certify isolated nodes and unresolved clusters under noise. The associated contour margin has an explicit degeneration rate as the sampling ratio approaches one. Numerical experiments show that the auxiliary scale improves both identifiability and resolution, and that certified contour counts can remain reliable beyond the regime of accurate pointwise recovery.