Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2509.11618

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2509.11618 (math)
[Submitted on 15 Sep 2025 ]

Title: Strong convergence rates of stochastic theta methods for index 1 stochastic differential algebraic equations under non-globally Lipschitz conditions

Title: 随机θ方法在非全局Lipschitz条件下对索引1随机微分代数方程的强收敛率

Authors:Lin Chen, Ziheng Chen, Jing Zhao
Abstract: This work investigates numerical approximations of index 1 stochastic differential algebraic equations (SDAEs) with non-constant singular matrices under non-global Lipschitz conditions. Analyzing the strong convergence rates of numerical solutions in this setting is highly nontrivial, due to both the singularity of the constraint matrix and the superlinear growth of the coefficients. To address these challenges, we develop an approach for establishing mean square convergence rates of numerical methods for SDAEs under global monotonicity conditions. Specifically, we prove that each stochastic theta method with $\theta \in [\frac{1}{2},1]$ achieves a mean square convergence rate of order $\frac{1}{2}$. Theoretical findings are further validated through a series of numerical experiments.
Abstract: 这项工作研究了在非全局利普希茨条件下,具有非常数奇异矩阵的索引1随机微分代数方程(SDAEs)的数值逼近。 在这种情况下分析数值解的强收敛率是非常困难的,这是由于约束矩阵的奇异性以及系数的超线性增长。 为了解决这些挑战,我们开发了一种方法,在全局单调性条件下建立SDAEs数值方法的均方收敛率。 具体而言,我们证明了每个带有$\theta \in [\frac{1}{2},1]$的随机θ方法可达到阶数为$\frac{1}{2}$的均方收敛率。 理论结果通过一系列数值实验进一步验证。
Subjects: Numerical Analysis (math.NA)
MSC classes: 60H10, 65C20, 65L20
Cite as: arXiv:2509.11618 [math.NA]
  (or arXiv:2509.11618v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2509.11618
arXiv-issued DOI via DataCite

Submission history

From: Ziheng Chen [view email]
[v1] Mon, 15 Sep 2025 06:21:47 UTC (98 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs.NA
math
math.NA

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号