首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Iterative solver for systems of linear equations with a sparse stiffness matrix on clusters
Authors:A A Kalinkin  Yu M Laevsky
Institution:(1) LaBRI, UMR CNRS 5800, ENSERB et Université Bordeaux 1, 351, cours de la Libération, F-33405 Talence, France;(2) CEA/CESTA, BP 2, F-33114 Le Barp, France
Abstract:In this paper, a package of programs for solving systems of linear equations with a sparse matrix for computers with distributed memory is proposed. The package is based on an iterative algorithm for solving the initial system of equations with a preconditioner constructed using an algebraic domain decomposition. Such an approach makes it possible to simultaneously multiply the preconditioner and the stiffness matrix by a vector on a cluster. Also, to improve the efficiency of computation, the functionalities PARDISO and Sparse BLAS of the Intel®MKL library are used on each process. In addition to processes parallelization, the package uses OpenMP parallelization on each of these processes, as well as Intel®MKL internal functional parallelization.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号