Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T15:52:51.798Z Has data issue: false hasContentIssue false

ANALYSIS OF BLOCK-SOR ITERATION FOR THE THREE-DIMENSIONAL LAPLACIAN

Published online by Cambridge University Press:  04 December 2009

WENJUN ZHENG
Affiliation:
School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, PR China (email: janal_zheng@uestc.edu.cn)
ZHIQIN ZHAO*
Affiliation:
School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, PR China (email: zqzhao@uestc.edu.cn)
*
✉For correspondence; e-mail: zqzhao@uestc.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The successive over-relaxation (SOR) iteration method for solving linear systems of equations depends upon a relaxation parameter. A well-known theory for determining this parameter was given by Young for consistently ordered matrices. In this paper, for the three-dimensional Laplacian, we introduce several compact difference schemes and analyse the block-SOR method for the resulting linear systems. Their optimum relaxation parameters are given for the first time. Analysis shows that the value of the optimum relaxation parameter of block-SOR iteration is very sensitive for compact stencils when solving the three-dimensional Laplacian. This paper provides a theoretical solution for determining the optimum relaxation parameter in real applications.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2009