On the efficiency of a SOR-like method suited to vector processors

DOI10.1016/0377-0427(91)90196-QMaRDI QIDQ806954zbMATH OpenOpenAlexFDO

Authors Masaaki Sugihara, Yoshio Oyanagi, Masatake Mori, Seiji Fujino

Publication date 1991

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(91)90196-q

zbMATH Keywords

convergence ratefive point discretizationhyperplane methodnine point discretizationPoisson equationsuccessive overrelaxationsupercomputersvector computers

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Parallel numerical computation (65Y05)

Review text

Consider the Poisson equation on the unit square, with the five point discretization. In the rowwise left to right and upwards ordering of the nodes, the successive overrelaxation (SOR) method uses the western and southern updates from the current iteration and the northern and eastern ones from the preceding iteration. The SOR-like method uses the new southern updates and the old ones for the remaining directions. This method has the advantage of being easily vectorizable with constant vector length, in opposition to the hyperplane version of SOR. On the other hand, the convergence rate of SOR is better by an order of magnitude. The authors also discuss the nine point discretization. They finally present a careful set of experiments carried on several powerful supercomputers. These experiments show that vectorized SOR, based on the hyperplane version, is always faster than vectorized SOR-like.

Recommendations

• A fully vectorizable SOR variant
• Vectorizable algorithm for the (multicolour) successive overrelaxation method
• The SOR method on parallel computers
• A parallelized point rowwise successive over-relaxation method on a multiprocessor
• scientific article; zbMATH DE number 4062465

Cites work

• Application of variational methods in the fixed and adaptive grid generation
• scientific article; zbMATH DE number 3174491 (Why is no real title available?)
• scientific article; zbMATH DE number 43693 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• The parallel execution of DO loops

Cited in

(6)

• Plasma equilibrium calculations by line successive over relaxation
• Vectorizable algorithm for the (multicolour) successive overrelaxation method
• A fully vectorizable SOR variant
• Some remarks on completely vectorizing point Gauss-Seidel while using the natural ordering
• Superiority of S method to EP method
• Performance of SOR methods on modern vector and scalar processors

This page was built for publication: On the efficiency of a SOR-like method suited to vector processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806954)