The ordering of large sparse symmetric matrices for small pro"le and wavefront or for small bandwidth is important for the e$ciency of frontal and variable-band solvers. In this paper, we look at the computation of pseudoperipheral nodes and compare the e!ectiveness of using an algorithm based on le
โฆ LIBER โฆ
Reducing the profile of sparse symmetric matrices
โ Scribed by Richard A. Snay
- Book ID
- 110546821
- Publisher
- Springer-Verlag
- Year
- 1976
- Tongue
- English
- Weight
- 474 KB
- Volume
- 50
- Category
- Article
- ISSN
- 1432-1394
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Ordering symmetric sparse matrices for s
โ
J. K. Reid; J. A. Scott
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 139 KB
Minimizing the bandwidth of sparse symme
โ
K. Y. Cheng
๐
Article
๐
1973
๐
Springer Vienna
๐
English
โ 434 KB
On the intermediate eigenvalues of symme
โ
A. Sameh; J. Lermit; K. Noh
๐
Article
๐
1975
๐
Springer Netherlands
๐
English
โ 338 KB
The Eigenvalues of Very Sparse Random Sy
โ
A. Juozulynas
๐
Article
๐
2004
๐
Springer
๐
English
โ 98 KB
A block solver for large, unsymmetric, s
โ
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
Note on minimizing the bandwidth of spar
โ
K. Y. Cheng
๐
Article
๐
1973
๐
Springer Vienna
๐
English
โ 162 KB