6 research outputs found
Recommended from our members
Preparing sparse solvers for exascale computing.
Sparse solvers provide essential functionality for a wide variety of scientific applications. Highly parallel sparse solvers are essential for continuing advances in high-fidelity, multi-physics and multi-scale simulations, especially as we target exascale platforms. This paper describes the challenges, strategies and progress of the US Department of Energy Exascale Computing project towards providing sparse solvers for exascale computing platforms. We address the demands of systems with thousands of high-performance node devices where exposing concurrency, hiding latency and creating alternative algorithms become essential. The efforts described here are works in progress, highlighting current success and upcoming challenges. This article is part of a discussion meeting issue 'Numerical algorithms for high-performance computational science'
On incomplete factorization implicit technique for 2D elliptic FD equations
A new variant of Incomplete Factorization Implicit (IFI) iterative technique for 2D elliptic finite-difference (FD) equations is suggested which is differed by applying the matrix tridiagonal algorithm. Its iteration parameter is shown be linked with the one for Alternating Direction Implicit method. An effective set of values for the parameter is suggested. A procedure for enhancing the set of iteration parameters for IFI is proposed. The technique is applied to a 5-point FD scheme, and to a 9-point FD scheme. It is suggested applying the solver for 5-point scheme to solving boundary-value problems for the 9-point scheme, too. The results of numerical experiment with Dirichlet and Neumann boundary-value problems for Poisson equation in a rectangle, and in a quasi-circle are presented. Mixed boundary-value problems in square are considered, too. The effectiveness of IFI is high, and weakly depends on the type of boundary conditions