谱分数扩散问题解的简化基近似

IF 3.8 2区 数学 Q1 MATHEMATICS Journal of Numerical Mathematics Pub Date : 2019-05-05 DOI:10.1515/jnma-2019-0053
A. Bonito, D. Guignard, Ashley R. Zhang
{"title":"谱分数扩散问题解的简化基近似","authors":"A. Bonito, D. Guignard, Ashley R. Zhang","doi":"10.1515/jnma-2019-0053","DOIUrl":null,"url":null,"abstract":"Abstract We consider the numerical approximation of the spectral fractional diffusion problem based on the so called Balakrishnan representation. The latter consists of an improper integral approximated via quadratures. At each quadrature point, a reaction–diffusion problem must be approximated and is the method bottle neck. In this work, we propose to reduce the computational cost using a reduced basis strategy allowing for a fast evaluation of the reaction–diffusion problems. The reduced basis does not depend on the fractional power s for 0 < smin ⩽ s ⩽ smax < 1. It is built offline once for all and used online irrespectively of the fractional power. We analyze the reduced basis strategy and show its exponential convergence. The analytical results are illustrated with insightful numerical experiments.","PeriodicalId":50109,"journal":{"name":"Journal of Numerical Mathematics","volume":null,"pages":null},"PeriodicalIF":3.8000,"publicationDate":"2019-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Reduced basis approximations of the solutions to spectral fractional diffusion problems\",\"authors\":\"A. Bonito, D. Guignard, Ashley R. Zhang\",\"doi\":\"10.1515/jnma-2019-0053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We consider the numerical approximation of the spectral fractional diffusion problem based on the so called Balakrishnan representation. The latter consists of an improper integral approximated via quadratures. At each quadrature point, a reaction–diffusion problem must be approximated and is the method bottle neck. In this work, we propose to reduce the computational cost using a reduced basis strategy allowing for a fast evaluation of the reaction–diffusion problems. The reduced basis does not depend on the fractional power s for 0 < smin ⩽ s ⩽ smax < 1. It is built offline once for all and used online irrespectively of the fractional power. We analyze the reduced basis strategy and show its exponential convergence. The analytical results are illustrated with insightful numerical experiments.\",\"PeriodicalId\":50109,\"journal\":{\"name\":\"Journal of Numerical Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2019-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Numerical Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/jnma-2019-0053\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Numerical Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/jnma-2019-0053","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 7

摘要

摘要考虑了基于Balakrishnan表示的谱分数扩散问题的数值逼近。后者由一个由正交近似的反常积分组成。在每个交点处,必须近似处理一个反应扩散问题,这是该方法的瓶颈。在这项工作中,我们建议使用减少基策略来降低计算成本,从而允许快速评估反应扩散问题。当0 < smin≤s≤smax < 1时,约简基不依赖于分数次幂s。它是离线一次性构建的,在线使用时不考虑分数功率。我们分析了简化基策略并证明了它的指数收敛性。通过数值实验对分析结果进行了说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reduced basis approximations of the solutions to spectral fractional diffusion problems
Abstract We consider the numerical approximation of the spectral fractional diffusion problem based on the so called Balakrishnan representation. The latter consists of an improper integral approximated via quadratures. At each quadrature point, a reaction–diffusion problem must be approximated and is the method bottle neck. In this work, we propose to reduce the computational cost using a reduced basis strategy allowing for a fast evaluation of the reaction–diffusion problems. The reduced basis does not depend on the fractional power s for 0 < smin ⩽ s ⩽ smax < 1. It is built offline once for all and used online irrespectively of the fractional power. We analyze the reduced basis strategy and show its exponential convergence. The analytical results are illustrated with insightful numerical experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.90
自引率
3.30%
发文量
17
审稿时长
>12 weeks
期刊介绍: The Journal of Numerical Mathematics (formerly East-West Journal of Numerical Mathematics) contains high-quality papers featuring contemporary research in all areas of Numerical Mathematics. This includes the development, analysis, and implementation of new and innovative methods in Numerical Linear Algebra, Numerical Analysis, Optimal Control/Optimization, and Scientific Computing. The journal will also publish applications-oriented papers with significant mathematical content in computational fluid dynamics and other areas of computational engineering, finance, and life sciences.
期刊最新文献
On the discrete Sobolev inequalities Stability and convergence of relaxed scalar auxiliary variable schemes for Cahn–Hilliard systems with bounded mass source Efficient numerical solution of the Fokker-Planck equation using physics-conforming finite element methods Fundamental Theory and R-linear Convergence of Stretch Energy Minimization for Spherical Equiareal Parameterization A posteriori error estimate for a WG method of H(curl)-elliptic problems
×
引用
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