中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A stroboscopic averaging algorithm for highly oscillatory delay problems

文献类型:期刊论文

作者Sanz-Serna, J. M.3; Zhu, Beibei1,2
刊名IMA JOURNAL OF NUMERICAL ANALYSIS
出版日期2019-07-01
卷号39期号:3页码:1110-1133
关键词delay differential equations stroboscopic averaging highly oscillatory problems
ISSN号0272-4979
DOI10.1093/imanum/dry020
英文摘要We propose and analyse a heterogeneous multiscale method for the efficient integration of constant-delay differential equations subject to fast periodic forcing. The stroboscopic averaging method suggested here may provide approximations with O(H-2 + 1/Omega(2)) errors with a computational effort that grows like H-1 (the inverse of the step size), uniformly in the forcing frequency Omega.
资助项目Ministerio de Economia y Comercio[MTM2013-46553-C3-1-P] ; Ministerio de Economia, Industria y Competitividad, Spain[MTM2016-77660-P] ; National Natural Science Foundation of China[11371357] ; National Natural Science Foundation of China[11771438]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000491259000002
出版者OXFORD UNIV PRESS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/35837]  
专题中国科学院数学与系统科学研究院
通讯作者Zhu, Beibei
作者单位1.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
2.Chinese Acad Sci, State Key Lab Sci & Engn Comp, Inst Computat Math & Sci Engn Comp, Acad Math & Syst Sci, Beijing 100190, Peoples R China
3.Univ Carlos III Madrid, Dept Matemat, Ave Univ 30, E-28911 Madrid, Spain
推荐引用方式
GB/T 7714
Sanz-Serna, J. M.,Zhu, Beibei. A stroboscopic averaging algorithm for highly oscillatory delay problems[J]. IMA JOURNAL OF NUMERICAL ANALYSIS,2019,39(3):1110-1133.
APA Sanz-Serna, J. M.,&Zhu, Beibei.(2019).A stroboscopic averaging algorithm for highly oscillatory delay problems.IMA JOURNAL OF NUMERICAL ANALYSIS,39(3),1110-1133.
MLA Sanz-Serna, J. M.,et al."A stroboscopic averaging algorithm for highly oscillatory delay problems".IMA JOURNAL OF NUMERICAL ANALYSIS 39.3(2019):1110-1133.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。