Implicit and Fully Discrete Approximation of the Supercooled Stefan Problem in the Presence of Blow-Ups

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-05-09 DOI:10.1137/22m1509722
Christa Cuchiero, Christoph Reisinger, Stefan Rigger
{"title":"Implicit and Fully Discrete Approximation of the Supercooled Stefan Problem in the Presence of Blow-Ups","authors":"Christa Cuchiero, Christoph Reisinger, Stefan Rigger","doi":"10.1137/22m1509722","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 3, Page 1145-1170, June 2024. <br/> Abstract.We consider two approximation schemes of the one-dimensional supercooled Stefan problem and prove their convergence, even in the presence of finite time blow-ups. All proofs are based on a probabilistic reformulation recently considered in the literature. The first scheme is a version of the time-stepping scheme studied by Kaushansky et al. [Ann. Appl. Probab., 33 (2023), pp. 274–298], but here the flux over the free boundary and its velocity are coupled implicitly. Moreover, we extend the analysis to more general driving processes than Brownian motion. The second scheme is a Donsker-type approximation, also interpretable as an implicit finite difference scheme, for which global convergence is shown under minor technical conditions. With stronger assumptions, which apply in cases without blow-ups, we obtain additionally a convergence rate arbitrarily close to 1/2. Our numerical results suggest that this rate also holds for less regular solutions, in contrast to explicit schemes, and allow a sharper resolution of the discontinuous free boundary in the blow-up regime.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"33 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-05-09","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/22m1509722","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 3, Page 1145-1170, June 2024.
Abstract.We consider two approximation schemes of the one-dimensional supercooled Stefan problem and prove their convergence, even in the presence of finite time blow-ups. All proofs are based on a probabilistic reformulation recently considered in the literature. The first scheme is a version of the time-stepping scheme studied by Kaushansky et al. [Ann. Appl. Probab., 33 (2023), pp. 274–298], but here the flux over the free boundary and its velocity are coupled implicitly. Moreover, we extend the analysis to more general driving processes than Brownian motion. The second scheme is a Donsker-type approximation, also interpretable as an implicit finite difference scheme, for which global convergence is shown under minor technical conditions. With stronger assumptions, which apply in cases without blow-ups, we obtain additionally a convergence rate arbitrarily close to 1/2. Our numerical results suggest that this rate also holds for less regular solutions, in contrast to explicit schemes, and allow a sharper resolution of the discontinuous free boundary in the blow-up regime.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
存在炸裂的过冷斯特凡问题的隐含和完全离散近似法
SIAM 数值分析期刊》第 62 卷第 3 期第 1145-1170 页,2024 年 6 月。 摘要.我们考虑了一维过冷斯特凡问题的两种近似方案,并证明了它们的收敛性,即使在存在有限时间炸裂的情况下也是如此。所有证明都基于最近文献中考虑的概率重述。第一个方案是 Kaushansky 等人研究的时间步进方案的一个版本[Ann. Appl. Probab.此外,我们还将分析扩展到比布朗运动更一般的驱动过程。第二种方案是 Donsker 型近似,也可以解释为隐式有限差分方案,在一些次要的技术条件下,可以显示全局收敛性。通过更强的假设(适用于没有炸毁的情况),我们还获得了任意接近 1/2 的收敛率。我们的数值结果表明,与显式方案相比,该收敛率也适用于不太规则的解,并能更清晰地解决炸毁机制中的不连续自由边界问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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