.png){kind=icon}
Return
Parallel H-matrix arithmetics on shared memory systems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-004-0102-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
H-matrices, as they were introduced in previous papers, allow the usage of the common matrix arithmetic in an efficient, almost optimal way. This article is concerned with the parallelisation of this arithmetics, in particular matrix building, matrix-vector multiplication, matrix multiplication and matrix inversion. Of special interest is the design of algorithms, which reuse as much as possible of the corresponding sequential methods, thereby keeping the effort to update an existing implementation at a minimum. This could be achieved by making use of the properties of shared memory systems as they are widely available in the form of workstations or compute servers. These systems provide a simple and commonly supported programming interface in the form of POSIX-threads. The theoretical results for the parallel algorithms are confirmed with numerical examples from BEM and FEM applications.
Keywords:
hierarchical matrices
parallel algorithms
shared memory systems
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveA sparse matrix arithmetic based on H-matrices.: Part I :: Introduction to H-matrices.png)
COMPUTING
COMPUTINGIF2.8
PREAI
ShareSaveOptimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled TrialPLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more