𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A direct parallel sparse matrix solver

✍ Scribed by T.M. Tran; R. Gruber; K. Appert; S. Wuthrich

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
680 KB
Volume
96
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

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 separation of the algorithm into a factorization stage and a solution stage, time-dependent problems with a constant coefficient matrix are particularly well suited for this solver. The parallelization performances obtained on a Cray T3D show that the method scales up to at least 256 processors.

πŸ“œ SIMILAR VOLUMES

A new parallel sparse direct solver: Pre
A new parallel sparse direct solver: Presentation and numerical experiments in large-scale structural mechanics parallel computing
✍ I. GuΓ¨ye; S. El Arem; F. Feyel; F.-X. Roux; G. Cailletaud πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract The main purpose of this work is to present a new parallel direct solver: __Dissection__ solver. It is based on __LU__ factorization of the sparse matrix of the linear system and allows to detect automatically and handle properly the zero‐energy modes, which are important when dealing w

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

Performance evaluation of a parallel spa
Performance evaluation of a parallel sparse lattice Boltzmann solver
✍ L. Axner; J. Bernsdorf; T. Zeiser; P. Lammers; J. Linxweiler; A.G. Hoekstra πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 342 KB

We develop a performance prediction model for a parallelized sparse lattice Boltzmann solver and present performance results for simulations of flow in a variety of complex geometries. A special focus is on partitioning and memory/load balancing strategy for geometries with a high solid fraction and

Parallel direct linear system solvers --
Parallel direct linear system solvers -- a survey
✍ Ahmed H. Sameh; David J. Kuck πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 510 KB

This paper is a survey of direct parallel algorithms for solving systems of linear equations. We present an up-to-date collection of algorithms for solving triangular, dense, and tridiagonal systems of equations. We state their resulting speedup over the corresponding sequential algorithms, and eva