检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Mathematical Sciences,University of Electronic Science and Technology of China,Chengdu,Sichuan 610054,China [2]School of Science,Sichuan University of Science and Engineering,Zigong,Sichuan 643000,China
出 处:《Communications in Computational Physics》2013年第8期780-800,共21页计算物理通讯(英文)
基 金:supported by the NSF of China(11226312,91130003);the NSF of Sichuan University of Science and Engineering(2012XJKRL005);the Opening Fund of Artificial Intelligence Key Laboratory of Sichuan Province(2011RZY04);the Chinese Universities Specialized Research Fund for the Doctoral Program(20110185110020).
摘 要:Schwarzwaveformrelaxation(SWR)algorithmhas been investigated deeply and widely for regular time dependent problems.But for time delay problems,complete analysis of the algorithm is rare.In this paper,by using the reaction diffusion equations with a constant discrete delay as the underlying model problem,we investigate the convergence behavior of the overlapping SWR algorithm with Robin transmission condition.The key point of using this transmission condition is to determine a free parameter as better as possible and it is shown that the best choice of the parameter is determined by the solution of a min-max problem,which is more complex than the one arising for regular problems without delay.We propose new notion to solve the min-max problem and obtain a quasi-optimized choice of the parameter,which is shown efficient to accelerate the convergence of the SWR algorithm.Numerical results are provided to validate the theoretical conclusions.
关 键 词:Schwarz method waveform relaxation time delay min-max problem
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249