文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Two proofs of convergence for the combination technique for the efficient solution of spars
侵权投诉

Two proofs of convergence for the combination technique for the efficient solution of spars

Abstract. For a simple model problem--- the Laplace equation on the unit square with a Dirichlet boundary function vanishing for x = 0, x = 1, and y = 1, and equaling some suitable g(x) for y = 0--- we present a proof of convergence for the combination tec

Contemporary Mathematics Volume 00, 0000

Two Proofs of Convergence for the Combination Technique for the E cient Solution of Sparse Grid Problems H.-J. BUNGARTZ, M. GRIEBEL, D. ROSCHKE, AND C. ZENGER Abstract. For a simple model problem| the Laplace equation on the unit square with a Dirichlet boundary function vanishing for x= 0, x= 1, and y= 1, and equaling some suitable g (x) for y= 0| we present a proof of convergence for the combination technique, a modern, e cient, and easily parallelizable sparse grid solver for elliptic partial di erential equations that recently gained importance in elds of applications like computational uid dynamics. For full square grids with meshwidth h and O(h?2 ) grid points, the order O(h2 ) of the discretization error using nite di erences was shown in 5], if g(x) C 2 0; 1]. In this paper, we show that the nite di erencediscretization error of the solution produced by the combination technique?on a sparse grid? with only O (h?1 log2 (h?1 ) grid points is of the order O h2 log2 (h?1 ), if the Fourier coe cients bk of g, the 2-periodic and 0-symmetric extension of~ g, ful ll bk cg k?3?" for some arbitrary small positive". If 0<" 1, this is vaild for g C 4 0; 1] and g(0)= g(1)= g00 (0)= g00 (1)= 0, e.g.. A simple transformation even shows that g C 4 0; 1] is su cient. We present results of numerical experiments with functions g of varying smoothness. 2 j j 2 2

interesting tool for the e cient solution of elliptic boundary value problems. Besides the implementation of a hierarchical nite element algorithm on sparse grids 1], it has been rst of all the combination technique 4] that attained attention in the sparse grid context. One of the main advantages of the combination technique stems from the properties of sparse grids 1]: In comparison to the standard full grid approach, the number of grid points can be reduced signi cantly from O(N d ) to O(N (log2 (N))d?1 ) in the d-dimensional case, whereas the accuracy of the calculated approximation to the solution is only slightly deteriorated from 1991 Mathematics Subject Classi cation. 35J05, 65N06, 65N15, 65N22, 65N55. This work is supported by the Bayerische Forschungsstiftung via FORTWIHR| The Bavarian Consortium for High Performance Scienti c Computing. This paper is in nal form, and no version of it will be submitted for publication elsewhere. c 0000 American Mathematical Society 0000-0000/00$1.00+$.25 per page

1. Introduction Since their presentation in 1990 7], sparse grids have turned out to be a very

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email