Presentation 1996/5/24
The convergence rates of the SOR methods with alternative orderings
Toshiki Takeuchi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The SOR method for solving a linear system of equations arising from the discretization of partial differential equations is often used. The SOR method with alternative ordering is known as the method to suited to vector processors. In this paper, we show the SOR methods with some orderings change the convergence rates to compare with the SOR method with the usual ordering. We also investigate theoretically the optimal acceleration parameter and the optimal convergence rate of the SOR method with the alternative ordering for a model problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) SOR / convergence rate / ordering / multicolor method / difference method
Paper # NLP96-1
Date of Issue

Conference Information
Committee NLP
Conference Date 1996/5/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) The convergence rates of the SOR methods with alternative orderings
Sub Title (in English)
Keyword(1) SOR
Keyword(2) convergence rate
Keyword(3) ordering
Keyword(4) multicolor method
Keyword(5) difference method
1st Author's Name Toshiki Takeuchi
1st Author's Affiliation Faculty of Engineering, The University of Tokushima()
Date 1996/5/24
Paper # NLP96-1
Volume (vol) vol.96
Number (no) 72
Page pp.pp.-
#Pages 4
Date of Issue