A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
复制标题
具有共享内存计算机上对称有限元矩阵内核检测功能的解剖求解器
DOI:
10.1002/nme.4729
复制
发表时间:
2014
影响因子:
2.9
通讯作者:
François
中科院分区:
文献类型:
--
作者:
Atsushi Suzuki;François
A direct solver for symmetric sparse matrices from finite element problems is presented. The solver is supposed to work as a local solver of domain decomposition methods for hybrid parallelization on cluster systems of multi‐core CPUs, and then it is required to run on shared memory computers and to have an ability of kernel detection. Symmetric pivoting with a given threshold factorizes a matrix with a decomposition introduced by a nested bisection and selects suspicious null pivots from the threshold. The Schur complement constructed from the suspicious null pivots is examined by a factorization with 1 × 1 and 2 × 2 pivoting and by a robust kernel detection algorithm based on measurement of residuals with orthogonal projections onto supposed image spaces. A static data structure from the nested bisection and a block sub‐structure for Schur complements at all bisection levels can use level 3 BLAS routines efficiently. Asynchronous task execution for each block can reduce idle time of processors drastically, and as a result, the solver has high parallel efficiency. Competitive performance of the developed solver to Intel Pardiso on shared memory computers is shown by numerical experiments. Copyright © 2014 John Wiley & Sons, Ltd.
DOI:
--
发表时间:
--
期刊:
影响因子:
--
作者:
通讯作者:
--