Mathematics > Numerical Analysis
[Submitted on 8 Nov 2023 (v1), last revised 17 Nov 2024 (this version, v5)]
Title:Discrete stochastic maximal $ L^p $-regularity and convergence of a spatial semidiscretization for a stochastic parabolic equation
View PDF HTML (experimental)Abstract:This study investigates the boundedness of the \( H^\infty \)-calculus for the negative discrete Laplace operator, subject to homogeneous Dirichlet boundary conditions. The negative discrete Laplace operator is implemented using the finite element method, and we establish that its \(H^\infty\)-calculus is uniformly bounded with respect to the spatial mesh size. Using this finding, we derive a discrete stochastic maximal \(L^p\)-regularity estimate for a spatial semidiscretization. Furthermore, we provide a nearly optimal pathwise uniform convergence estimate for this spatial semidiscretization under a wide range of spatial \(L^q\)-norms.
Submission history
From: Binjie Li [view email][v1] Wed, 8 Nov 2023 11:31:52 UTC (26 KB)
[v2] Sun, 19 Nov 2023 02:45:41 UTC (26 KB)
[v3] Mon, 3 Jun 2024 16:18:06 UTC (31 KB)
[v4] Thu, 5 Sep 2024 10:44:41 UTC (36 KB)
[v5] Sun, 17 Nov 2024 16:39:43 UTC (37 KB)
Current browse context:
math.NA
References & Citations
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
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
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.