{"title":"求解亥姆霍兹方程柯西问题的加速Dirichlet–Robin交替算法","authors":"F. Berntsson, Jennifer Chepkorir, V. Kozlov","doi":"10.1093/IMAMAT/HXAB034","DOIUrl":null,"url":null,"abstract":"\n The Cauchy problem for Helmholtz equation, for moderate wave number $k^{2}$, is considered. In the previous paper of Achieng et al. (2020, Analysis of Dirichlet–Robin iterations for solving the Cauchy problem for elliptic equations. Bull. Iran. Math. Soc.), a proof of convergence for the Dirichlet–Robin alternating algorithm was given for general elliptic operators of second order, provided that appropriate Robin parameters were used. Also, it has been noted that the rate of convergence for the alternating iterative algorithm is quite slow. Thus, we reformulate the Cauchy problem as an operator equation and implement iterative methods based on Krylov subspaces. The aim is to achieve faster convergence. In particular, we consider the Landweber method, the conjugate gradient method and the generalized minimal residual method. The numerical results show that all the methods work well. In this work, we discuss also how one can approach non-symmetric differential operators by using similar operator equations and model problems which are used for symmetric differential operators.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2021-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Accelerated Dirichlet–Robin alternating algorithms for solving the Cauchy problem for the Helmholtz equation\",\"authors\":\"F. Berntsson, Jennifer Chepkorir, V. Kozlov\",\"doi\":\"10.1093/IMAMAT/HXAB034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n The Cauchy problem for Helmholtz equation, for moderate wave number $k^{2}$, is considered. In the previous paper of Achieng et al. (2020, Analysis of Dirichlet–Robin iterations for solving the Cauchy problem for elliptic equations. Bull. Iran. Math. Soc.), a proof of convergence for the Dirichlet–Robin alternating algorithm was given for general elliptic operators of second order, provided that appropriate Robin parameters were used. Also, it has been noted that the rate of convergence for the alternating iterative algorithm is quite slow. Thus, we reformulate the Cauchy problem as an operator equation and implement iterative methods based on Krylov subspaces. The aim is to achieve faster convergence. In particular, we consider the Landweber method, the conjugate gradient method and the generalized minimal residual method. The numerical results show that all the methods work well. In this work, we discuss also how one can approach non-symmetric differential operators by using similar operator equations and model problems which are used for symmetric differential operators.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2021-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1093/IMAMAT/HXAB034\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1093/IMAMAT/HXAB034","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
Accelerated Dirichlet–Robin alternating algorithms for solving the Cauchy problem for the Helmholtz equation
The Cauchy problem for Helmholtz equation, for moderate wave number $k^{2}$, is considered. In the previous paper of Achieng et al. (2020, Analysis of Dirichlet–Robin iterations for solving the Cauchy problem for elliptic equations. Bull. Iran. Math. Soc.), a proof of convergence for the Dirichlet–Robin alternating algorithm was given for general elliptic operators of second order, provided that appropriate Robin parameters were used. Also, it has been noted that the rate of convergence for the alternating iterative algorithm is quite slow. Thus, we reformulate the Cauchy problem as an operator equation and implement iterative methods based on Krylov subspaces. The aim is to achieve faster convergence. In particular, we consider the Landweber method, the conjugate gradient method and the generalized minimal residual method. The numerical results show that all the methods work well. In this work, we discuss also how one can approach non-symmetric differential operators by using similar operator equations and model problems which are used for symmetric differential operators.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.