Convergence of a regularized finite element discretization of the two-dimensional Monge–Ampère equation

IF 2.2 2区 数学 Q1 MATHEMATICS, APPLIED Mathematics of Computation Pub Date : 2023-02-06 DOI:10.1090/mcom/3794
D. Gallistl, Ngoc Tien Tran
{"title":"Convergence of a regularized finite element discretization of the two-dimensional Monge–Ampère equation","authors":"D. Gallistl, Ngoc Tien Tran","doi":"10.1090/mcom/3794","DOIUrl":null,"url":null,"abstract":"<p>This paper proposes a regularization of the Monge–Ampère equation in planar convex domains through uniformly elliptic Hamilton–Jacobi–Bellman equations. The regularized problem possesses a unique strong solution <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"u Subscript epsilon\">\n <mml:semantics>\n <mml:msub>\n <mml:mi>u</mml:mi>\n <mml:mi>ε<!-- ε --></mml:mi>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">u_\\varepsilon</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> and is accessible to the discretization with finite elements. This work establishes uniform convergence of <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"u Subscript epsilon\">\n <mml:semantics>\n <mml:msub>\n <mml:mi>u</mml:mi>\n <mml:mi>ε<!-- ε --></mml:mi>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">u_\\varepsilon</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> to the convex Alexandrov solution <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"u\">\n <mml:semantics>\n <mml:mi>u</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">u</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> to the Monge–Ampère equation as the regularization parameter <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"epsilon\">\n <mml:semantics>\n <mml:mi>ε<!-- ε --></mml:mi>\n <mml:annotation encoding=\"application/x-tex\">\\varepsilon</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> approaches <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"0\">\n <mml:semantics>\n <mml:mn>0</mml:mn>\n <mml:annotation encoding=\"application/x-tex\">0</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>. A mixed finite element method for the approximation of <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"u Subscript epsilon\">\n <mml:semantics>\n <mml:msub>\n <mml:mi>u</mml:mi>\n <mml:mi>ε<!-- ε --></mml:mi>\n </mml:msub>\n <mml:annotation encoding=\"application/x-tex\">u_\\varepsilon</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> is proposed, and the regularized finite element scheme is shown to be uniformly convergent. The class of admissible right-hand sides are the functions that can be approximated from below by positive continuous functions in the <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper L Superscript 1\">\n <mml:semantics>\n <mml:msup>\n <mml:mi>L</mml:mi>\n <mml:mn>1</mml:mn>\n </mml:msup>\n <mml:annotation encoding=\"application/x-tex\">L^1</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> norm. Numerical experiments provide empirical evidence for the efficient approximation of singular solutions <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"u\">\n <mml:semantics>\n <mml:mi>u</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">u</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2023-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Computation","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/mcom/3794","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a regularization of the Monge–Ampère equation in planar convex domains through uniformly elliptic Hamilton–Jacobi–Bellman equations. The regularized problem possesses a unique strong solution u ε u_\varepsilon and is accessible to the discretization with finite elements. This work establishes uniform convergence of u ε u_\varepsilon to the convex Alexandrov solution u u to the Monge–Ampère equation as the regularization parameter ε \varepsilon approaches 0 0 . A mixed finite element method for the approximation of u ε u_\varepsilon is proposed, and the regularized finite element scheme is shown to be uniformly convergent. The class of admissible right-hand sides are the functions that can be approximated from below by positive continuous functions in the L 1 L^1 norm. Numerical experiments provide empirical evidence for the efficient approximation of singular solutions u u .

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二维Monge–Ampère方程正则化有限元离散化的收敛性
利用一致椭圆Hamilton-Jacobi-Bellman方程,提出了平面凸域上monge - amp方程的正则化方法。正则化问题具有唯一的强解u ε u_\varepsilon,可以用有限元进行离散化。本文建立了当正则化参数ε \varepsilon趋近于0时,u ε u_\varepsilon对monge - ampontre方程的凸Alexandrov解u u的一致收敛性。提出了一种混合有限元逼近u ε u_\varepsilon的方法,并证明了正则化有限元格式是一致收敛的。可容许的右手边是那些可以用l1l ^1范数中的正连续函数从下逼近的函数。数值实验为奇异解的有效逼近提供了经验证据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematics of Computation
Mathematics of Computation 数学-应用数学
CiteScore
3.90
自引率
5.00%
发文量
55
审稿时长
7.0 months
期刊介绍: All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. This journal is devoted to research articles of the highest quality in computational mathematics. Areas covered include numerical analysis, computational discrete mathematics, including number theory, algebra and combinatorics, and related fields such as stochastic numerical methods. Articles must be of significant computational interest and contain original and substantial mathematical analysis or development of computational methodology.
期刊最新文献
Doubly isogenous genus-2 curves with 𝐷₄-action Stability and convergence analysis of a fully discrete semi-implicit scheme for stochastic Allen-Cahn equations with multiplicative noise Computing the spectral gap of a family of matrices Convergence of a regularized finite element discretization of the two-dimensional Monge–Ampère equation Enumeration of left braces with additive group 𝐶₄×𝐶₄×𝐶₄
×
引用
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