๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Experiences of sparse direct symmetric solvers

โœ Scribed by Scott, Jennifer A.; Hu, Yifan

Book ID
121415693
Publisher
Association for Computing Machinery
Year
2007
Tongue
English
Weight
170 KB
Volume
33
Category
Article
ISSN
0098-3500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The design and use of a sparse direct so
The design and use of a sparse direct solver for skew symmetric matrices
โœ Iain S. Duff ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 380 KB

## GMRES a b s t r a c t We consider the LDL T factorization of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used in a forthcoming dire

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

A block solver for large, unsymmetric, s
A block solver for large, unsymmetric, sparse, banded matrices with symmetric profiles
โœ K. G. Manoj; S. K. Bhattacharyya ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 375 KB

A block equation solver for the solution of large, sparse, banded unsymmetric system of linear equations is presented in this paper. The method employs Crout variation of Gauss elimination technique for the solution. The solver ensures the efficient use of the available memory by doing block factori