A SOR iterative algorithm for the finite difference and the finite element methods that is efficient and parallelizable
type: Item
instance of: scholarly article
title: A SOR iterative algorithm for the finite difference and the finite element methods that is efficient and parallelizable
zbMATH Open document ID: 0823.65036
DOI: 10.1016/0965-9978(94)90073-6
author: Yanyan Li
published in: Advances in Engineering Software
publication date: 1995-10-24T00:00:00Z
review text: An efficient and simple parallel successive overrelaxation (SOR) iterative algorithm is presented for finite difference and finite element methods. Based on domain subdividing and computing sequence reordering, this algorithm is proven to be efficient and simple to implement.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 749570
zbMATH Keywords: parallel computation
zbMATH Keywords: domain decomposition
zbMATH Keywords: successive overrelaxation
zbMATH Keywords: iterative algorithm
zbMATH Keywords: finite difference
zbMATH Keywords: finite element
reviewed by: Costică Moroşanu
MaRDI profile type: Publication
full work available at URL: 0965-9978(94)90073-6
OpenAlex ID: W2035620546
description: scientific article; zbMATH DE number 749570