{"title":"Burgers方程具有内在并行性的交替分段显隐格式","authors":"Guanyu Xue, Hui Feng","doi":"10.1080/23324309.2019.1709081","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, an alternating segment explicit-implicit (ASE-I) scheme with intrinsic parallelism for Burgers’ equation is proposed. The scheme has second-order truncation error in space and it is linear stable by analysis of the linearization procedure. The ASE-I scheme can be extended to solve two-dimensional Burgers’ equations by alternating direction implicit (ADI) technique. Numerical experiments show the new scheme is efficient and reliable.","PeriodicalId":54305,"journal":{"name":"Journal of Computational and Theoretical Transport","volume":"49 1","pages":"15 - 30"},"PeriodicalIF":0.7000,"publicationDate":"2020-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/23324309.2019.1709081","citationCount":"4","resultStr":"{\"title\":\"An Alternating Segment Explicit-Implicit Scheme with Intrinsic Parallelism for Burgers’ Equation\",\"authors\":\"Guanyu Xue, Hui Feng\",\"doi\":\"10.1080/23324309.2019.1709081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, an alternating segment explicit-implicit (ASE-I) scheme with intrinsic parallelism for Burgers’ equation is proposed. The scheme has second-order truncation error in space and it is linear stable by analysis of the linearization procedure. The ASE-I scheme can be extended to solve two-dimensional Burgers’ equations by alternating direction implicit (ADI) technique. Numerical experiments show the new scheme is efficient and reliable.\",\"PeriodicalId\":54305,\"journal\":{\"name\":\"Journal of Computational and Theoretical Transport\",\"volume\":\"49 1\",\"pages\":\"15 - 30\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2020-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/23324309.2019.1709081\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational and Theoretical Transport\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/23324309.2019.1709081\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Theoretical Transport","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/23324309.2019.1709081","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
An Alternating Segment Explicit-Implicit Scheme with Intrinsic Parallelism for Burgers’ Equation
Abstract In this paper, an alternating segment explicit-implicit (ASE-I) scheme with intrinsic parallelism for Burgers’ equation is proposed. The scheme has second-order truncation error in space and it is linear stable by analysis of the linearization procedure. The ASE-I scheme can be extended to solve two-dimensional Burgers’ equations by alternating direction implicit (ADI) technique. Numerical experiments show the new scheme is efficient and reliable.
期刊介绍：
Emphasizing computational methods and theoretical studies, this unique journal invites articles on neutral-particle transport, kinetic theory, radiative transfer, charged-particle transport, and macroscopic transport phenomena. In addition, the journal encourages articles on uncertainty quantification related to these fields. Offering a range of information and research methodologies unavailable elsewhere, Journal of Computational and Theoretical Transport brings together closely related mathematical concepts and techniques to encourage a productive, interdisciplinary exchange of ideas.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
