Dynamic Properties of Numerical Solution for Stochastic Epidemic Models with a Fully Implicit Form

Zeyao Jin; Zhiming Li; Shenglong Chen

Home/Archive/arXiv

arXiv · 2610.36924

Dynamic Properties of Numerical Solution for Stochastic Epidemic Models with a Fully Implicit Form

Zeyao Jin·Zhiming Li·Shenglong Chen

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper establishes a fully implicit model to investigate the spread of epidemics and studies its dynamic properties, extending the semi-implicit model in Yang et al.(Commun. Nonlinear Sci. Numer. Simul., 152 (2026) 109140 ). We first employ the split-step backward Euler method to address the non-adaptability arising from backward Euler discretization and ensure the global convergence of the numerical solution. By linearizing the model, the computational cost is reduced at the expense of a slight increase in error, effectively avoiding complex iterative solution processes. Then, we derive the existence, uniqueness, positivity, and boundedness of the numerical solution, and obtain its global convergence order. On this basis, the extinction and persistence of the disease are investigated under three different scenarios. The results indicate that environmental noise is a key factor leading to disease extinction. Finally, numerical simulations visually verify the obtained theoretical conclusions.

Explore related subjects

math.NA cs.NA math.PR stat.AP

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Zeyao Jin, Zhiming Li, Shenglong Chen. 2026-10-27. Dynamic Properties of Numerical Solution for Stochastic Epidemic Models with a Fully Implicit Form. https://arxiv.org/abs/2610.36924

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

KEEP EXPLORING

Related papers

arXiv2026

An Arbitrary-Lagrangian-Eulerian solver for relativistic detonation waves

In this paper we study the dynamics of relativistic detonation waves theoretically and numerically. The reaction is physically accounted for by an extra term in the definition of the total energy density and by an additional equation for the evolution of the mass fraction of the reactant, while leaving formally unmodified the equations of mass and energy-momentum conservation. In this way, the Rankine-Hugoniot relations maintain the same formal structure of the inert version. For the numerical solution we use a finite volume ALE scheme with a second order TVD space-time reconstruction for the homogeneous part of the system, where the mesh velocity is chosen equal to the shock speed, and we combine it through operator splitting with a locally implicit algorithm for the potentially stiff reaction source terms that arise in the equation of the reactant. We furthermore propose a particularly efficient algorithm for the conversion from the conserved to the primitive variables, which for the relativistic Euler equations is known to be nontrivial. Following this approach, we can successfully solve the Zel'dovich-von Neumann-Doering profile of a relativistic detonation wave, up to Lorentz factors of the shock front $γ_s\sim 7$. Our analysis allowed us to highlight a new special relativistic effect, which has remained unnoticed so far. While in Newtonian detonations the Zel'dovich pressure jump decreases monotonically with the mass flux through the shock front, in the relativistic case it shows a minimum and then rises monotonically as a function of the mass flux. This may have interesting physical implications on the amount of energy that can be extracted from a relativistic detonation wave.

math.NA↗

arXiv2026

Sketch-and-Restart: Randomized Sketching in Quadrature-Based Restarting for Matrix Functions

We develop a sketch-and-restart framework for computing the action of a matrix function on a vector, $f(A) b$, where $A$ is large, sparse, and non-Hermitian. The framework combines quadrature-based restarting with Arnoldi-like decompositions generated by sketched or truncated Arnoldi processes. Within this framework, we develop two classes of restarted algorithms. The first uses a fixed Krylov subspace dimension and is based either on the sketched Arnoldi process or on a new sketched harmonic Arnoldi process proposed in this work. The second class chooses the Krylov subspace dimension adaptively by running the truncated Arnoldi process until the condition number of the generated basis, estimated from its sketch, exceeds a prescribed threshold. We also establish the convergence of the restarted sketched harmonic Arnoldi method for Stieltjes functions under the assumption that $A$ is positive real. Numerical experiments demonstrate the effectiveness of the proposed framework, including the computational savings achieved through sketching, the storage reduction enabled by adaptive truncation, and the acceleration obtained from thick restarting.

math.NA↗

arXiv2026

A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the QT-Product with Applications to Color Video Processing

Based on the complex representation of quaternion matrices, this paper revisits the quaternion tensor singular value decomposition (QT-SVD) under the QT-product and establishes the corresponding $z$-block circulant matrix decomposition. We develop an efficient implementation of the QT-SVD. Numerical experiments show that this implementation is substantially faster than QT-SVD based on the quaternion matrix SVD approach \cite[Theorem~2.3]{AMLzhang2022} while maintaining high numerical accuracy. We further apply the QT-SVD to color video encryption and reconstruction. Experiments on five DAVIS video sequences show that the QT-SVD achieves higher reconstruction quality and shorter decomposition times than the quaternion T-SVD \cite{tsvdarxiv} under the same processing procedure. Both methods exhibit comparable ciphertext statistics and differential sensitivity, while the QT-SVD introduces less additional distortion under the tested input perturbations.

math.NA↗