Splitting Schemes with Additive Representation of the Operator at the Time Derivative

{"title":"Splitting Schemes with Additive Representation of the Operator at the Time Derivative","authors":"","doi":"10.3103/s0278641924010096","DOIUrl":null,"url":null,"abstract":"<span> <h3>Abstract</h3> <p>Additive (splitting) schemes are used to contruct effective computational algorithms for approximately solving initial-boundary value problems for nonstationary partial differential equations. Splitting schemes are normally used when the main operator of a problem has an additive representation. Problems where the operator at the time derivative of a solution is split are also of interest. For first-order evolution equations, we propose splitting schemes based on transforming the original equation to an equivalent system of equations.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"100 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Computational Mathematics and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0278641924010096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Additive (splitting) schemes are used to contruct effective computational algorithms for approximately solving initial-boundary value problems for nonstationary partial differential equations. Splitting schemes are normally used when the main operator of a problem has an additive representation. Problems where the operator at the time derivative of a solution is split are also of interest. For first-order evolution equations, we propose splitting schemes based on transforming the original equation to an equivalent system of equations.

在时间导数上用加法表示算子的拆分方案
摘要 加性(分裂)方案用于构建有效的计算算法,以近似求解非稳态偏微分方程的初始边界值问题。当问题的主算子具有加性表示时,通常会使用拆分方案。解的时间导数算子被拆分的问题也值得关注。对于一阶演化方程,我们提出了基于将原始方程转换为等效方程组的拆分方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信