A SOR iterative algorithm for the finite difference and the finite element methods that is efficient and parallelizable
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.
scientific article; zbMATH DE number 749570