Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.19008

Exponential Stability of Slow--Fast Stochastic Systems with a Small Delay

Yudong Wang·Kele Sun·Shijie Zhou·Xuerong Mao
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the exponential stability of coupled slow--fast stochastic systems with a small delay. Under an averaged Lyapunov condition, we establish practical $p$th-moment exponential stability for $0<p<2$ using a cutoff-function approach to handle singular Lyapunov derivatives near the origin. Exponential stability in the $p$th moment and almost surely is further obtained through two distinct mechanisms: homogeneous dissipation of the fast dynamics or vanishing sensitivity of the slow coefficients to the fast state near the origin. We extend these results to locally Lipschitz systems, establishing exponential stability with arbitrarily high probability for bounded sets of initial data, thereby broadening the applicability of stability analysis for stochastic systems with delayed feedback. Numerical examples illustrate our results.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yudong Wang, Kele Sun, Shijie Zhou, Xuerong Mao. 2026-10-13. Exponential Stability of Slow--Fast Stochastic Systems with a Small Delay. https://arxiv.org/abs/2610.19008

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

KEEP EXPLORING

Related papers

arXiv2026

A novel class of high-order uniformly accurate exponential integrators with local linear extension for the charged-particle dynamics under strong magnetic field

In this paper, we develop a novel class of high-order uniformly accurate exponential integrators for charged-particle dynamics under strong magnetic field. The small parameter $0<\varepsilon\ll 1$ induces rapid temporal oscillations, rendering traditional numerical methods prohibitively expensive due to severe step-size restrictions. To address this issue, a linearization technology that introduces auxiliary polynomial variables is employed to recast the original charged-particle dynamics as a higher-dimensional system. Classical exponential integrators are subsequently applied to this augmented formulation, which inherently carries richer structural information, thereby yielding a family of uniformly accurate exponential integrators that can reach arbitrarily high order without requiring any order conditions. For strong magnetic fields under the maximal-ordering scaling, we rigorously establish through algebraic techniques that the schemes with auxiliary polynomial variables of degree $k\geq2$ achieve an improved position error bound of $\mathcal{O}(\min\{\varepsilon^{k+1}h,\varepsilon h^{k+1}\})$ and a uniform velocity error bound of $\mathcal{O}(\min\{\varepsilon^{k}h,h^{k+1}\})$, where $h$ denotes the time-step size. Under the additional condition that the magnetic field gradient vanishes at the origin, these bounds sharpen to $\mathcal{O}(\min\{\varepsilon^{k+2},\varepsilon h^{k+1}\})$ and $\mathcal{O}(\min\{\varepsilon^{k+1},h^{k+1}\})$ for the position and velocity, respectively, for $k\geq1$. The same sharper bounds hold for constant strong magnetic fields. Numerical experiments confirm the advantages of the proposed methods.

math.NA↗
arXiv2026

TensorSpectra: Bridging the Spectral and Tensor Worlds for High-Dimensional PDEs

High-dimensional partial differential equations (PDEs) remain challenging for spectral methods due to the exponential growth of multidimensional coefficient spaces. We propose TensorSpectra, a low-rank spectral framework that directly parameterizes spectral coefficient tensors in canonical polyadic (CP) form, reducing representation complexity from $\mathcal{O}(N^d)$ to $\mathcal{O}(dNr)$. TensorSpectra combines structure-preserving spectral calculus, de-aliased nonlinear interactions, operator-aware residual weighting, and progressive low-rank corrections to enable efficient PDEs solving in compressed coefficient space. We further establish a theoretical framework connecting spectral truncation, low-rank approximation, and optimization errors. Extensive experiments across five PDE families and 24 benchmark configurations demonstrate State-Of-The-Art accuracy among five representative baselines, with TensorSpectra consistently achieving the lowest relative $L^2$ errors. More broadly, our findings offer a new perspective on high-dimensional PDEs solving, suggesting that exploiting intrinsic low-rank structure in spectral coefficient space provides a viable alternative to conventional physical-space approaches.

math.NA↗
arXiv2026

Randomized algorithms in numerical linear algebra for scientific computing

Randomized numerical linear algebra (RNLA) has fundamentally changed the landscape of scientific computing over the last twenty to thirty years. While early breakthroughs focused primarily on low-rank approximation and least-squares problems, randomized techniques are now used to solve a broad range of linear algebra problems, supporting applications spanning data science, optimization, and computational engineering. This paper surveys some of the main ideas of RNLA, focusing on methods that are effective in practice and on simple theoretical bounds that can be used to understand them. We highlight the core benefits of randomization: improved scalability, algorithmic simplicity, and---contrary to what the name may suggest---remarkable reliability and numerical stability. Topics include sketching, low-rank approximation, least squares, orthogonalization and approximate orthogonalization, randomized Krylov subspace methods, preconditioning, trace and spectral density estimation, row and column selection algorithms, posterior error estimation, randomized regularization, and tensor-structured randomness.

math.NA↗