Identifying the source term in the potential equation with weighted sparsity regularization

IF 2.2 2区 数学 Q1 MATHEMATICS, APPLIED Mathematics of Computation Pub Date : 2024-01-17 DOI:10.1090/mcom/3941
Ole Elvetun, Bjørn Nielsen
{"title":"Identifying the source term in the potential equation with weighted sparsity regularization","authors":"Ole Elvetun, Bjørn Nielsen","doi":"10.1090/mcom/3941","DOIUrl":null,"url":null,"abstract":"<p>We explore the possibility for using boundary measurements to recover a sparse source term <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"f left-parenthesis x right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">f(x)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in the potential equation. Employing weighted sparsity regularization and standard results for subgradients, we derive simple-to-check criteria which assure that a number of sinks (<inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"f left-parenthesis x right-parenthesis greater-than 0\"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> <mml:mo>&gt;</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">f(x)&gt;0</mml:annotation> </mml:semantics> </mml:math> </inline-formula>) and sources (<inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"f left-parenthesis x right-parenthesis greater-than 0\"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> <mml:mo>&gt;</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">f(x)&gt;0</mml:annotation> </mml:semantics> </mml:math> </inline-formula>) can be identified. Furthermore, we present two cases for which these criteria always are fulfilled: (a) well-separated sources and sinks, and (b) many sources or sinks located at the boundary plus one interior source/sink. Our approach is such that the linearity of the associated forward operator is preserved in the discrete formulation. The theory is therefore conveniently developed in terms of Euclidean spaces, and it can be applied to a wide range of problems. In particular, it can be applied to both isotropic and anisotropic cases. We present a series of numerical experiments. This work is motivated by the observation that standard methods typically suggest that internal sinks and sources are located close to the boundary.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":"37 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-01-17","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/3941","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We explore the possibility for using boundary measurements to recover a sparse source term f ( x ) f(x) in the potential equation. Employing weighted sparsity regularization and standard results for subgradients, we derive simple-to-check criteria which assure that a number of sinks ( f ( x ) > 0 f(x)>0 ) and sources ( f ( x ) > 0 f(x)>0 ) can be identified. Furthermore, we present two cases for which these criteria always are fulfilled: (a) well-separated sources and sinks, and (b) many sources or sinks located at the boundary plus one interior source/sink. Our approach is such that the linearity of the associated forward operator is preserved in the discrete formulation. The theory is therefore conveniently developed in terms of Euclidean spaces, and it can be applied to a wide range of problems. In particular, it can be applied to both isotropic and anisotropic cases. We present a series of numerical experiments. This work is motivated by the observation that standard methods typically suggest that internal sinks and sources are located close to the boundary.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用加权稀疏正则化识别电势方程中的源项
我们探讨了利用边界测量来恢复势方程中稀疏源项 f ( x ) f(x) 的可能性。利用加权稀疏正则化和子梯度的标准结果,我们推导出简单易查的标准,确保可以识别出若干汇( f ( x ) > 0 f(x)>0 )和源( f ( x ) > 0 f(x)>0 )。此外,我们还介绍了始终满足这些标准的两种情况:(a) 源和汇完全分离;(b) 许多源或汇位于边界加上一个内部源/汇。我们的方法是在离散表述中保留相关前向算子的线性。因此,该理论可以方便地在欧几里得空间中展开,并可应用于各种问题。特别是,它既可用于各向同性的情况,也可用于各向异性的情况。我们介绍了一系列数值实验。标准方法通常认为内部汇和源位于边界附近,而这一观察结果正是这项工作的动机。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Error bounds for Gauss–Jacobi quadrature of analytic functions on an ellipse Müntz Legendre polynomials: Approximation properties and applications A random active set method for strictly convex quadratic problem with simple bounds Fourier optimization and Montgomery’s pair correlation conjecture Virtual element methods for Biot–Kirchhoff poroelasticity
×
引用
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