{"title":"亥姆霍兹方程数据补全问题的加速交替迭代算法","authors":"Karzan A. Berdawood, A. Nachaoui, M. Nachaoui","doi":"10.19139/soic-2310-5070-1702","DOIUrl":null,"url":null,"abstract":"This paper deals with an inverse problem governed by the Helmholtz equation. It consists in recovering lackingdata on a part of the boundary based on the Cauchy data on the other part. We propose an optimal choice of the relaxationparameter calculated dynamically at each iteration. This choice of relaxation parameter ensures convergence without priordetermination of the interval of the relaxation factor required in our previous work. The numerous numerical example showsthat the number of iterations is drastically reduced and thus, our new relaxed algorithm guarantees the convergence for allwavenumber k and gives an automatic acceleration without any intervention of the user.","PeriodicalId":131002,"journal":{"name":"Statistics, Optimization & Information Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An accelerated alternating iterative algorithm for data completion problems connected with Helmholtz equation\",\"authors\":\"Karzan A. Berdawood, A. Nachaoui, M. Nachaoui\",\"doi\":\"10.19139/soic-2310-5070-1702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with an inverse problem governed by the Helmholtz equation. It consists in recovering lackingdata on a part of the boundary based on the Cauchy data on the other part. We propose an optimal choice of the relaxationparameter calculated dynamically at each iteration. This choice of relaxation parameter ensures convergence without priordetermination of the interval of the relaxation factor required in our previous work. The numerous numerical example showsthat the number of iterations is drastically reduced and thus, our new relaxed algorithm guarantees the convergence for allwavenumber k and gives an automatic acceleration without any intervention of the user.\",\"PeriodicalId\":131002,\"journal\":{\"name\":\"Statistics, Optimization & Information Computing\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Statistics, Optimization & Information Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19139/soic-2310-5070-1702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Statistics, Optimization & Information Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19139/soic-2310-5070-1702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An accelerated alternating iterative algorithm for data completion problems connected with Helmholtz equation
This paper deals with an inverse problem governed by the Helmholtz equation. It consists in recovering lackingdata on a part of the boundary based on the Cauchy data on the other part. We propose an optimal choice of the relaxationparameter calculated dynamically at each iteration. This choice of relaxation parameter ensures convergence without priordetermination of the interval of the relaxation factor required in our previous work. The numerous numerical example showsthat the number of iterations is drastically reduced and thus, our new relaxed algorithm guarantees the convergence for allwavenumber k and gives an automatic acceleration without any intervention of the user.