𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A domain-decomposing parallel sparse linear system solver

✍ Scribed by Murat Manguoglu

Book ID
113511717
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
340 KB
Volume
236
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tearing-based hybrid parallel sparse l
A tearing-based hybrid parallel sparse linear system solver
✍ Maxim Naumov; Murat Manguoglu; Ahmed H. Sameh πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 742 KB

We propose a hybrid sparse system solver for handling linear systems using algebraic domain decomposition-based techniques. The solver consists of several stages. The first stage uses a reordering scheme that brings as many of the largest matrix elements as possible closest to the main diagonal. Thi

Parallel frontal solvers for large spars
Parallel frontal solvers for large sparse linear systems
✍ Scott, Jennifer A. πŸ“‚ Article πŸ“… 2003 πŸ› Association for Computing Machinery 🌐 English βš– 127 KB

Many applications in science and engineering give rise to large sparse linear systems of equations that need to be solved as efficiently as possible. As the size of the problems of interest increases, it can become necessary to consider exploiting multiprocessors to solve these systems. We report on

A direct parallel sparse matrix solver
A direct parallel sparse matrix solver
✍ T.M. Tran; R. Gruber; K. Appert; S. Wuthrich πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 680 KB

The direct sparse matrix solver is based on a domain decomposition technique to achieve data and work parallelization. Geometries that have long and thin structures are specially efficiently tractable with this solver, provided that they can be decomposed mainly in one direction. Due to the separati