-
a coarse-grain parallel solver for systems of linear algebraic equations with general sparse matrices by gaussian elimination is...important than the second one and has a significant influence on the performance of the solver. a straightforward implementation of the reordering algorithm will result ino(n2) operations...
Journal: Computing
, vol. 54, no. 1, pp. 39-67, 1995
-
Journal: Computing
, vol. 54, no. 1, pp. 39-68, 1995
-
...of this paper is the parallelization of a plasticity algorithm that uses an implicit method and an incremental
approach. more precisely...scheduling of block computations for parallel sparse linear factorization. the associated solver, based on a supernodal
fan-in approach, is...
-
...we present a parallel hybrid sparse linear system solver that is suitable for the solution of large sparse linear systems on parallel computing platforms. this study is...lack of scalability of direct sparse system solvers. our hybrid solver is as robust as direct solvers and as scalable as iterative solvers. our method relies on weighted...
-
...next generation of highly scalable sparse linear system solvers. these solvers must optimize parallel performance, processor (serial) perfor- mance...robust across broad classes of applications and systems. in this paper, we present a new parallel solver that combines the desirable characteristics...
-
...many scientific applications need to solve very large sparse linear systems in order to simulate phenomena close to the reality.
grid computing is...synchronizations slow down performances. thus it is desirable
to reduce the number of synchronizations in a parallel direct algorithm. inspired from multisplitting techniques, the...
-
a new method for the parallel solution of large sparse linear systems is introduced. it proceeds by dividing the equations...processors. carp is very robust; its application to test cases of linear systems derived from pdes shows that it converges in difficult cases where...
-
...techniques used for the nonsymmetric sparse linear system solver, mcsparse, on the cedar system are described. a novel reordering scheme (h*) upon which the solver is based is presented. the...cause stability concerns. another approach to parallel sparse solvers exploits the dy namic identification and application of parallel pivots (1, 8, 18, 43...
-
...multistep successive preconditioning strategies (msp) to construct a class of parallel multilevel sparse approximate inverse (sai) preconditioners. we do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. the purpose of introducing multilevel structure into sai is to enhance the robustness of sai...
-
...in this paper, a nonsymmetric sparse linear system solver based on the exploitation of multilevel parallelism is proposed. one of the...stability. this is accomplished by a combination of a novel reordering technique (h*) and pivoting strategy. the large grain parallelism exposed by the reordering is combined with medium (various...