Discrete Maximal Regularity for the Discontinuous Galerkin Time-Stepping Method without Logarithmic Factor

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-07-22 DOI:10.1137/23m1580802
Takahito Kashiwabara, Tomoya Kemmochi
{"title":"Discrete Maximal Regularity for the Discontinuous Galerkin Time-Stepping Method without Logarithmic Factor","authors":"Takahito Kashiwabara, Tomoya Kemmochi","doi":"10.1137/23m1580802","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 4, Page 1638-1659, August 2024. <br/> Abstract. Maximal regularity is a kind of a priori estimate for parabolic-type equations, and it plays an important role in the theory of nonlinear differential equations. The aim of this paper is to investigate the temporally discrete counterpart of maximal regularity for the discontinuous Galerkin (DG) time-stepping method. We will establish such an estimate without logarithmic factor over a quasi-uniform temporal mesh. To show the main result, we introduce the temporally regularized Green’s function and then reduce the discrete maximal regularity to a weighted error estimate for its DG approximation. Our results would be useful for investigation of DG approximation of nonlinear parabolic problems.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"27 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1580802","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Journal on Numerical Analysis, Volume 62, Issue 4, Page 1638-1659, August 2024.
Abstract. Maximal regularity is a kind of a priori estimate for parabolic-type equations, and it plays an important role in the theory of nonlinear differential equations. The aim of this paper is to investigate the temporally discrete counterpart of maximal regularity for the discontinuous Galerkin (DG) time-stepping method. We will establish such an estimate without logarithmic factor over a quasi-uniform temporal mesh. To show the main result, we introduce the temporally regularized Green’s function and then reduce the discrete maximal regularity to a weighted error estimate for its DG approximation. Our results would be useful for investigation of DG approximation of nonlinear parabolic problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无对数因子的非连续伽勒金时间步进方法的离散最大正则性
SIAM 数值分析期刊》第 62 卷第 4 期第 1638-1659 页,2024 年 8 月。 摘要最大正则性是抛物型方程的一种先验估计,在非线性微分方程理论中占有重要地位。本文旨在研究非连续伽勒金(DG)时步法的最大正则性的时间离散对应关系。我们将在准均匀时间网格上建立这种不含对数因子的估计。为了说明主要结果,我们引入了时间正则化的格林函数,然后将离散最大正则性简化为其 DG 近似的加权误差估计。我们的结果将有助于研究非线性抛物问题的 DG 近似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.80
自引率
6.90%
发文量
110
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.
期刊最新文献
On the Existence of Minimizers in Shallow Residual ReLU Neural Network Optimization Landscapes A Domain Decomposition Method for Stochastic Evolution Equations New Time Domain Decomposition Methods for Parabolic Optimal Control Problems II: Neumann–Neumann Algorithms The Mean-Field Ensemble Kalman Filter: Near-Gaussian Setting The Lanczos Tau Framework for Time-Delay Systems: Padé Approximation and Collocation Revisited
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1