Convergence of the sinc overlapping domain decomposition method

被引:7
|
作者
Morlet, AC
Lybeck, NJ
Bowers, KL [1 ]
机构
[1] Montana State Univ, Dept Math Sci, Bozeman, MT 59717 USA
[2] Ohio State Univ, Dept Math, Columbus, OH 43210 USA
[3] N Carolina State Univ, Ctr Res Sci Computat, Raleigh, NC 27695 USA
基金
美国国家科学基金会;
关键词
domain decomposition; sinc method; sinc collocation; overlapping;
D O I
10.1016/S0096-3003(97)10168-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The sinc-collocation overlapping method is developed for two-point boundary-value problems for second-order ordinary differential equations. The discrete system is formulated and the bordering algorithm used for the solution of this system is described. It is then shown that the convergence rate is exponential even if the solution has boundary singularities. The details of the convergence proof are given for a sinc-collocation method for two-point boundary-value problems when the original domain is divided into two subdomains. The extension to multiple domains is then straightforward. The analytical results are illustrated with numerical examples that exhibit the exponential convergence rate. (C) 1999 Elsevier Science Inc. All rights reserved.
引用
下载
收藏
页码:209 / 227
页数:19
相关论文
共 50 条