文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > On convergence of iterative methods for a fourth-order discretization scheme
侵权投诉

On convergence of iterative methods for a fourth-order discretization scheme

We prove that, under certain conditions, some classical iterative methods converge for the linear system resulting from a fourth-order compact discretization of the convection-diffusion equation. Key words: Linear systems, iterative methods, fourth-order c

Lemma 3.2 The coe cients of the nine-point stencil (4) satisfy the following conditions hold: or

5 7>0

and 6 8> 0 if one of

j j< 1; j j< 1; j j> 1; j j> 1:

(6) (7) (8)

(1? 2 )(1? 2 )> 0: It is easy to see that (8) holds if either (6) holds or (7) holds. The conditions for 6 8> 0 can be veri ed similarly.

Proof.

5 7

> 0 if

2 2

Lemma 3.3 The matrix A is irreducible. Proof. It is readily veri ed that the directed graph of A is strongly connected. Lemma 3.4 The matrix A is irreducibly diagonally dominant if j j 1 and j j 1. Proof. A is diagonally dominant if 2 X ja j ja j; for i= 1;:::; n2: n i;i j

=1 6= ;j

i;j

(9) (10) (11)

i

(3) and (9) imply

j 0j

8 X j

Substituting (4) in (10) after simpli cation, we have (j1+ j+ j1? j)(j1+ j+ j1? j) 4: Since (j1+ j+ j1? j)= 2 if j j 1, and (j1+ j+ j1? j)= 2 if j j 1, it follows that (11) holds if j j 1 and j j 1 both hold. A is irreducible by Lemma 3.3. Since the strict inequality in (9) holds for at least the rst row of A for j j 1 and j j 1, A is irreducibly d

iagonally dominant (see pp. 23 of Varga 7]). 2 From Lemmas 3.3 and 3.4, we have the following theorem: Theorem 3.5 The point Jacobi and the point Gauss-Seidel methods associated with A for j j 1 and j j 1 are convergent for any initial guess. Proof. A is irreducibly diagonally dominant by Lemma 3.4. The result follows from Theorem 3.4, pp. 73 of Varga 7]. 2

=1

j j: j

4 Symmetrization of the Coe cient Matrix Theorem 3.5 establishes the convergence property of the point Jacobi and point Gauss-Seidel methods with the fourth-order compact scheme when the problem is di usion-dominated. To analytically show the convergence of classical iterative methods with this scheme for larger cell Reynolds number, following Elman and Golub 2], we rst show that, under certain circumstances, A is symmetrizable by a real diagonal similarity transformation. 3

上一页第3页

你可能喜欢

热门文档

相关文档

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