Search arXiv⌕ Search

arXiv subjects

Matthias Ehrhardt

Publications and source records attributed to Matthias Ehrhardt.

At least 19 recordsLinked to original sources

Mass-lumped finite elements with maximum-bound preservation and original-energy dissipation for the degenerate-mobility Allen-Cahn equation

In this work, we propose a mass-lumped finite element method for the Allen-Cahn equation that incorporates nonlinear mobility which may degenerate. The spatial approximation uses continuous, piecewise linear, mass-lumped finite elements, while convex splitting is employed for the double-well potential in time. Under the standard non-obtuse mesh condition, it is shown that the resulting fully discrete method preserves the maximum-bound principle unconditionally: if the initial approximation takes values in $[-1, 1]$, then so does the numerical solution at every time level. Additionally, the method dissipates the original discrete Ginzburg-Landau energy without any time-step restriction, even when the mobility vanishes at pure phases. This analysis relies on the monotonicity of the lumped finite element operator and the convexity of the split potential. Numerical experiments confirm these theoretical properties and demonstrate the robustness of the method in phase-separation dynamics involving degenerate mobility.

math.NA↗

Graph-Convolutional Reinforcement Learning for Finite-Time Stabilization of a Chaotic Chua Circuit via Unified Flexible Terminal Sliding-Mode Control

This paper introduces a graph convolutional reinforcement learning framework for the finite-time stabilization of chaotic dynamics in a physical Chua circuit. The circuit is modeled directly in terms of capacitor voltages, inductor current, and physical component parameters. This preserves the connection between the mathematical model and the underlying electrical system. A unified, flexible terminal sliding-mode controller is developed to achieve stabilization within a finite time in the presence of uncertainties in the lumped model, external disturbances, and bounded control inputs. The controller incorporates state-dependent nonlinear exponents to provide flexible convergence characteristics while avoiding singular terms near equilibrium. To minimize dependence on manual controller tuning, the admissible controller parameters are optimized using an actor-critic reinforcement learning scheme with a graph convolutional network that leverages the circuit dynamics' coupling structure. The learned parameters are constrained to the ranges required by the theoretical stability conditions. Numerical experiments demonstrate the rapid suppression of chaotic oscillations and the finite-time convergence of the state and sliding variables while respecting the prescribed input-saturation limits. Compared to a reference control method, the proposed approach reduces the IAE, ISE, ITAE, and ITSE by 56.27\,\%, 56.40\,\%, 61.69\,\%, and 64.70\,\%, respectively. These results suggest that graph-based reinforcement learning can effectively tune parameters while retaining the robustness and analytical structure of the underlying sliding-mode controller.

math.DS↗

Taming Nonconvexity with Epigraph Lifting

We consider inverse problems regularized by a trained neural network with \emph{convex activations} and \emph{unrestricted weights}. The resulting optimization problem is generally nonconvex, and gradient-based methods may converge to poor local minima. We introduce a \emph{penalized epigraph lifting} of the network and show that the lifted problem admits a \emph{difference-of-convex (DC) decomposition}. For Lipschitz continuous activations, we establish \emph{finite exactness}: the original objective is recovered exactly at a finite and explicitly computable penalty threshold $\barρ$. Building on this structure, we propose \emph{H-DC} (Homotopic DC), a homotopic scheme that solves a sequence of DC subproblems with increasing $ρ$, warm-starting each level from the previous solution. Numerical experiments on synthetic problems, a manifold denoiser regularizer, and image inpainting with a learned Mumford--Shah regularizer show that H-DC consistently escapes poor local minima and reaches solutions with lower objective values than gradient-based methods from the same initialization.

math.OC↗

Transparent Boundary Conditions for the Time-Fractional Heat Equation on Metric Graphs

In this work, we study transparent boundary conditions for the time-fractional heat equation on a metric star graph. This equation is the standard continuum model for subdiffusive heat and mass transport in disordered and porous branched media. Using the Laplace transform to solve the exterior branch problems, we demonstrate that the non-local vertex operator observed by the incoming bond is an Abel-type convolution kernel of order $β/2$, which generalizes the classical half-derivative kernel recovered at $β=1$. Our main result is that the diffusion-coefficient sum rule $κ_1=κ_2+κ_3$, known to eliminate thermal backflow for the classical heat equation, remains unchanged for every fractional order $β$: the transparency of the junction depends only on the network's diffusivities and not on the memory of the transport law. We rigorously prove this and uniqueness for the coupled vertex problem. We confirm our results numerically at the level of the underlying coupled partial differential equation system with an implicit L1 finite-difference scheme. We compare the star-graph solution to a reference solution on an unbranched line with matching diffusivity.

math.AP↗

Structure-Preserving Data-Driven Identification of Port-Hamiltonian Differential-Algebraic Systems

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.

math.NA↗

Transparent Boundary Conditions for the Heat Equation on Metric Graphs

We study transparent boundary conditions (TBCs) for the time-dependent heat equation in a branching, quasi-one-dimensional domain modeled as a metric star graph. By combining the classical concept of TBCs with the theory of partial differential equations (PDEs) on networks, we derive an exact vertex condition that ensures unobstructed thermal flow across junctions. Specifically,we derive a sum rule for the diffusion coefficients that eliminates thermal backflow at the vertex.We demonstrate the validity of this analytical model numerically using a Crank-Nicolson finite-difference method, which confirms smooth, unobstructed heat propagation through the network.These results provide a practical mathematical framework for tunable control and optimization of thermal diffusion in low-dimensional structures. In particular, combining the well-known concept of the TBCs and theory for PDE on metric graphs, we propose a mathematical model providing a control tool for thermal diffusion in networks.

math-ph↗

Transparent boundary conditions for the spatially discrete Schrödinger equation: Reflectionless quantum transport in 1D lattices

We construct exact transparent boundary conditions (TBCs) for a time-continuous, spatially discrete Schrödinger equation that models a one-dimensional quantum lattice. Using a recently developed exact solution for the discrete system, we derive the Dirichlet-to-Neumann maps analytically via Laplace transforms. This yields a convolution-type boundary condition governed by Bessel functions. We rigorously demonstrate the consistency of this discrete formulation with its continuous counterpart in the continuum limit. Additionally, we present an efficient time-discretization scheme based on the trapezoidal rule for practical implementation. Numerical experiments using a Crank-Nicolson solver verify that our proposed TBCs eliminate spurious backscattering entirely and preserve reflectionless propagation of a Gaussian wave packet exiting the computational domain

math-ph↗

Structure-Preserving Neural ODEs via Nonstandard Finite Difference Discretization

Although neural ordinary differential equations (NODEs) are a powerful framework for learning continuous-time dynamics, they generally do not preserve essential qualitative properties, such as positivity. We propose a structure-preserving Neural ODE framework based on nonstandard finite difference (NSFD) discretization. The learned dynamics are parameterized by nonnegative production and destruction rates, yielding an explicit, differentiable update that integrates seamlessly into standard automatic differentiation pipelines. We prove that the resulting scheme unconditionally preserves positivity for arbitrary time-step sizes while retaining first-order consistency. We outline an extension based on Patankar-type discretizations that preserves conservation laws exactly. Numerical experiments on an SIR epidemic model show that our approach generates physically meaningful trajectories, remains robust under coarse discretizations, and outperforms conventional NODEs in preserving the qualitative structure of the learned dynamics.

math.NA↗

A perfectly matched layer approach for the spectral split-step Padé method

The split-step-Padé (SSP) method is widely used to model wave phenomena in various applications, including radio physics, optics and acoustics. In this method, the propagator of the one-way counterpart of the Helmholtz equation is computed through its Padé approximant and a finite-difference discretization of the transverse operator. This work develops and validates numerically a spectral counterpart of the SSP method. A key challenge in practical applications is inverting the transverse operator in the presence of perfectly matched layers (PMLs), which are commonly used to truncate the computational domain. Such inversion can be accomplished using Krylov subspace methods, which converge rapidly, provided that a suitable preconditioner is used. We also study the analytical properties of the spectral SSP marching scheme under periodicity conditions in the transverse variable. We validate the newly developed spectral SSP method numerically in two realistic test scenarios from radio physics and underwater acoustics.

math.NA↗

A Nonstandard Finite Difference Scheme for a Nonlinear Parabolic Equation with p-Laplacian-Type Diffusion

We propose and analyze a nonstandard finite difference (NSFD) scheme for nonlinear parabolic equations involving a p-Laplacian-type diffusion operator in one- and two-dimensional spatial domains. Following Mickens' design principles, the proposed discretization employs a nonlinear denominator function phi(.) together with a nonlocal approximation of the nonlinear diffusion term Delta_p, yielding a structure-preserving discrete model. The scheme is designed to retain key qualitative properties of the continuous problem, including positivity, boundedness, and stability, which may be lost by standard finite difference methods (FDMs). We establish the well-posedness of the continuous model, derive the NSFD scheme, and investigate its consistency, convergence, and local truncation error. Numerical experiments confirm the theoretical results and demonstrate that, unlike the standard explicit FDM, the proposed NSFD scheme avoids spurious oscillations and nonphysical negative solutions even for relatively large time-step sizes.

math.NA↗

A Fractional-Memory Physics-Informed Neural Network with Fast History Compression for Tempered Fractional Coupled Phase-Field Systems

Tempered time-fractional coupled phase-field (tTFCP) systems are used to model interfacial phenomena involving memory-dependent transport and relaxation mechanisms. Numerical solutions to these systems are challenging due to the simultaneous presence of nonlocal temporal operators, weak initial singularities, moving diffuse interfaces, and strongly coupled multiphysics dynamics. In this work, we introduce FM-tfPINN (fractional-memory physics-informed neural network), which is used for forward simulation and inverse parameter identification in tempered fractional coupled phase-field systems. Unlike conventional fractional PINNs, which enforce memory effects solely through residual constraints, our framework incorporates tempered fractional memory directly into the neural representation via latent memory-source functions and a tempered fractional integral operator. We develop a fast shifted residual formulation based on graded temporal meshes and sum-of-exponentials (SOE) history compression to efficiently evaluate the tempered fractional operators. This framework combines interface-aware and residual-adaptive collocation strategies, improving resolution near evolving diffuse interfaces. A unified, physics-informed loss formulation allows for the forward prediction and inverse recovery of unknown physical parameters from sparse observations. We assess the proposed method on a class of tempered fractional corrosion phase-field models, including one-dimensional corrosion-front propagation, activation- and diffusion-controlled regimes, two-dimensional pitting corrosion, and inverse mobility identification problems. The numerical results demonstrate the accurate recovery of coupled phase and concentration fields, the robust prediction of physically relevant interface diagnostics, and the reliable estimation of parameters from limited data.

math.NA↗

Structure-Preserving Schemes for a Fractional SVIR Epidemic Model with a Hybrid Mittag-Leffler-Caputo-Fabrizio Operator

This paper proposes and analyzes a fractional-order SVIR epidemic model based on a hybrid Mittag-Leffler-Caputo-Fabrizio (MLCF) fractional operator with a nonsingular kernel. This model captures short- and long-term memory effects in epidemic transmission dynamics. The positivity and boundedness of the solutions are proven through an integrated formulation of the MLCF operator and a fractional Gronwall inequality. The basic reproduction number $\mathcal{R}_0$, equilibrium points, and their local and global stability properties are rigorously investigated through Jacobian analysis, logarithmic Lyapunov functionals, and a fractional LaSalle invariance principle. To approximate the model, a $θ$-weighted nonstandard finite difference (NSFD) method is developed. This method preserves the continuous system's key qualitative properties, including positivity and boundedness, and is unconditionally stable in the fully implicit case. Consistency and first-order convergence are also proven. Numerical experiments, together with sensitivity and bifurcation analyses, illustrate the impact of fractional memory parameters on epidemic evolution and demonstrate the effectiveness of the proposed approach.

math.NA↗

A Koopman-PINN Framework for Epidemic Models: Parameter Inference and Forecasting

We propose a Koopman-enhanced physics-informed neural network (K--PINN) framework for parameter inference and forecasting in nonlinear epidemic models. This method combines Koopman operator theory and physics-informed learning. It maps epidemic states into a latent observable space where the dynamics evolve approximately linearly while satisfying the governing epidemic equations through automatic differentiation. This integration improves interpretability, parameter identifiability, and long-term predictive stability. We apply the proposed framework to a normalized SEIRSD epidemic model and evaluate it using synthetic monkeypox (Mpox) data and real-world datasets from Germany, Morocco, and Sweden for the SARS-CoV-2 virus. Synthetic trajectories are generated using a structure-preserving, nonstandard finite difference scheme to ensure reliable training data. Numerical results demonstrate that K--PINN achieves more accurate parameter estimation, trajectory reconstruction, and long-term forecasting than classical PINNs and Koopman-EDMD approaches. These results suggest that K--PINN is an effective machine learning framework for epidemic modeling that can be extended to more complex systems.

stat.AP↗

A Generalized Hacker Dynamics Model with Nonlinear Incidence: Analysis and Positivity-Preserving Numerical Simulation

We propose and analyze a generalized compartment model for hacker dynamics in cybersecurity systems. This model is an extension of a recently introduced framework, replacing the bilinear interaction term with a broad class of nonlinear incidence functions. This provides greater modeling flexibility and allows for the description of a wider range of cyber-propagation and information-spreading processes. First, we investigate the qualitative dynamics of the model. We establish the positivity and boundedness of solutions, derive the basic reproduction number, and characterize the existence of hacker-free and hacker-present equilibria. We obtain local and global asymptotic stability results, yielding a complete description of the global dynamics in terms of the basic reproduction number. Next, we develop a second-order, positivity-preserving, nonstandard finite difference (NSFD) scheme for numerical simulations. Unlike many existing NSFD approaches, which are typically first-order accurate, the proposed method achieves second-order convergence while preserving positivity for arbitrary step sizes. Furthermore, the proposed method reproduces the asymptotic stability properties of the continuous model, making it suitable for long-time simulations. Numerical experiments validate the theoretical results and demonstrate the superior accuracy and qualitative performance of the proposed scheme compared to several first-order methods.

math.NA↗

Constraint-Aware Physics-Informed Neural Networks for SEIR Reaction-Diffusion Epidemic Models with Vital Dynamics

Reaction-diffusion epidemic models with vital dynamics are an important framework for describing the spatial and temporal spread of infectious diseases. In this work, we present a constraint-aware, physics-informed neural network (PINN) approach to an SEIR reaction-diffusion system with homogeneous Neumann boundary conditions. Due to the scarcity of spatial epidemiological datasets, we generate synthetic benchmark data using structure-preserving implicit-explicit nonstandard finite difference (NSFD) schemes that ensure positivity, boundedness, and numerical stability. The PINN framework integrates PDE residuals, observational data, boundary conditions, and epidemiological constraints within a unified optimization procedure. Specifically, the loss function incorporates the non-negativity of compartment populations and the admissibility of epidemiological parameters. We apply the method to forward simulation and inverse parameter estimation in one- and two-dimensional settings. Numerical experiments demonstrate the framework's ability to accurately reconstruct spatiotemporal epidemic dynamics and reliably identify parameters, even when data is sparse or noisy. These results underscore the potential of constraint-aware PINNs as a robust, data-driven methodology for spatial epidemic modeling.

math.DS↗

Alikhanov-XfPINNs: Adaptive Physics-Informed Learning for Nonlinear Fractional PDEs on Nonuniform Meshes

To address the initial singularity inherent in solutions to fractional partial differential equations (fPDEs), we propose an accelerated Alikhanov discretization formulation implemented on nonuniform time grids. Based on the physics-informed neural networks (PINNs) framework, we introduce an Alikhanov-extended fractional PINNs (XfPINNs) architecture that combines high-order temporal discretization and deep learning. The nonlocal memory term in fPDEs leads to high computational cost, while the weak singularity near $t\to 0^+$ can deteriorate accuracy on uniform meshes. To separate temporal discretization effects from optimization and sampling errors, we further develop an auxiliary time-marching configuration that enables auditable temporal-convergence studies under controlled training tolerances. This architecture can solve general nonlinear fPDEs. The XfPINNs approach is designed for forward and inverse problems, allowing for data-driven solution reconstruction and parameter estimation. First, the neural network approximates the solution of nonlinear fPDEs; then, an adaptive activation function accelerates convergence and enhances training efficiency. The optimization framework embeds a variational loss function constructed from the Alikhanov scheme, where the initial and boundary conditions are imposed using a combination of hard and soft constraints. Numerical experiments, including cases with known and unknown exact solutions which demonstrate the robustness, computational efficiency, and significant CPU time savings of the Alikhanov-XfPINNs method.

math.NA↗

Stochastic Port-Hamiltonian Neural Networks: Universal Approximation with Passivity Guarantees

Stochastic port-Hamiltonian systems represent open dynamical systems with dissipation, inputs, and stochastic forcing in an energy based form. We introduce stochastic port-Hamiltonian neural networks, SPH-NNs, which parameterize the Hamiltonian with a feedforward network and enforce skew symmetry of the interconnection matrix and positive semidefiniteness of the dissipation matrix. For Itô dynamics we establish a weak passivity inequality in expectation under an explicit generator condition, stated for a stopped process on a compact set. We also prove a universal approximation result showing that, on any compact set and finite horizon, SPH-NNs approximate the coefficients of a target stochastic port-Hamiltonian system with $C^2$ accuracy of the Hamiltonian and yield coupled solutions that remain close in mean square up to the exit time. Experiments on noisy mass spring, Duffing, and Van der Pol oscillators show improved long horizon rollouts and reduced energy error relative to a multilayer perceptron baseline.

cs.LG↗

Structure-Preserving Coupling and Decoupling of Port-Hamiltonian Systems

The port-Hamiltonian framework is a structure-preserving modeling approach that preserves key physical properties such as energy conservation and dissipation. When subsystems are modeled as port-Hamiltonian systems (pHS) with linearly related inputs and outputs, their interconnection remains port-Hamiltonian. This paper introduces a systematic method for transforming coupled port Hamiltonian ordinary differential equations systems (pHODE) into a single monolithic formulation, and for decomposing a monolithic system into weakly coupled subsystems. The monolithic representation ensures stability and structural integrity, whereas the decoupled form enables efficient distributed simulation via operator splitting or dynamic iteration.

math.DS↗