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
1(1), 1–7 (1993) On the Convergence of Basic Iterative Methods for ...If the stiffness matrix resulting from FE or FV discretization on an ...
On convergence and performance of iterative methods with fourth-order compact... fourth-order compact discretization 1 Introduction We rst consider the one ...
Comments on Analysis of A Fourth-Order Compact Scheme for Convection-... equation, fourth-order compact discretization scheme, iterative methods. ...
order 2 and SUPERLINEAR CONVERGENCE OF A ... and on the discretization scheme used for the ...[22] Y. Saad, Iterative Methods for Sparse ...
On the Convergence of Ba... 暂无评价 24页 ... ITERATIVE METHODS FOR STABILIZED DISCRETE CONVECTION...The choice of discretization influences the ...
Discretization Formulas Approximating the rst order ...Iterative methods may not converge for given ...Convergence may depend on the degree of ...
in the sense that bounds on the convergence of iterative methods are ... of order 1/ h, where h is the mesh size used in the discretization....
Discretization (Interpolation Methods) Field variables...scheme may aid in accelerating convergence for ...Included to improve stability of iterative process....
discretization to a close-by conforming ...fourth order elliptic problems kuk2 H 1 X 22j...on convergence properties of iterative solvers for ...
Old and new convergence proofs for multigrid ...the discretization of partial di erential equations...The standard reference on iterative methods is ...
热门文档