Convergence of the sinc overlapping domain decomposition method (Q1294325)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence of the sinc overlapping domain decomposition method |
scientific article; zbMATH DE number 1311126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of the sinc overlapping domain decomposition method |
scientific article; zbMATH DE number 1311126 |
Statements
Convergence of the sinc overlapping domain decomposition method (English)
0 references
29 June 1999
0 references
An initial implementation of a sinc-collocation domain decomposition method for two-point boundary value problems with boundary singularities is investigated. The algorithm used to find the solution of an equation approximated with the overlapping method relies on the bordering algorithm [cf. \textit{H. B. Keller}, Numerical solution of bifurcation and nonlinear eigenvalue problems, in: Ph. H. Rabinowitz (ed.), Applications of bufurcation theory, Academic Press, New York, 359-384 (1977; Zbl 0581.65043)] and on block Gaussian elimination. The convergence proof of the overlapping sinc domain decomposition method for one-dimensional problems is presented. From the estimates for auxiliary problems, the sinc approximation is shown to converge to the solution of the ordinary differential equation.
0 references
sinc-collocation domain decomposition method
0 references
two-point boundary value problems
0 references
boundary singularities
0 references
bordering algorithm
0 references
block Gaussian elimination
0 references
convergence
0 references
0 references