Premium
Fast Computation of Linear Systems Based on Parallelized Preconditioned MRTR Method Supported by Block‐Multicolor Ordering in Electromagnetic Field Analysis Using Edge‐Based Finite Element Method
Author(s) -
TSUBURAYA TOMONORI,
OKAMOTO YOSHIFUMI,
SATO SHUJI
Publication year - 2017
Publication title -
electronics and communications in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.131
H-Index - 13
eISSN - 1942-9541
pISSN - 1942-9533
DOI - 10.1002/ecj.11977
Subject(s) - krylov subspace , cholesky decomposition , conjugate gradient method , computer science , computation , parallel computing , block (permutation group theory) , finite element method , algorithm , linear system , matrix (chemical analysis) , computational science , iterative method , mathematics , eigenvalues and eigenvectors , geometry , mathematical analysis , physics , materials science , quantum mechanics , composite material , thermodynamics
SUMMARY To realize fast electromagnetic field analysis, the parallelization technique has been often introduced into the preconditioned Krylov subspace method. When the multicolor ordering is applied to parallelization of forward and backward substitution, the elapsed time of matrix calculation might increase owning to the increment of bandwidth. Therefore, the block‐multicolor ordering based on the level structure arising in reverse Cuthill–McKee ordering has been developed. The validity of developed method was demonstrated on the parallelized incomplete‐Cholesky‐preconditioned conjugate gradient method. In this paper, the parallelization performance of preconditioned minimized residual method based on the three‐term recurrence formula of the CG‐type (MRTR) method supported by developed ordering is investigated. Furthermore, the affinity of developed ordering or cache‐cache elements technique for parallelized forward and backward substitution in Eisenstat's technique is particularly examined.