𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data structures for compact sparse matrices representation

✍ Scribed by P. Di Felice; A. Agnifili; E. Clementini

Publisher
Elsevier Science
Year
1989
Weight
680 KB
Volume
11
Category
Article
ISSN
0141-1195

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel sparse matrix vector multiply s
Parallel sparse matrix vector multiply software for matrices with data locality
✍ TUMINARO, RAY S.; SHADID, JOHN N.; HUTCHINSON, SCOTT A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 339 KB

In this paper we describe general software utilities for performing unstructured sparse matrixvector multiplications on distributed-memory message-passing computers. The matrix-vector multiply comprises an important kernel in the solution of large sparse linear systems by iterative methods. Our focu

Representation of weakly structured impr
Representation of weakly structured imprecise data for fuzzy querying
✍ Rallou Thomopoulos; Patrice Buche; Ollivier HaemmerlΓ© πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 308 KB

In the present paper, we introduce an extension of the conceptual graph model suitable to the representation of data which are modelized using fuzzy sets. We extend the specialization relation of the conceptual graph model to fuzzy conceptual graphs. Lastly we introduce a new way of comparing concep

A hierarchic sparse matrix data structur
A hierarchic sparse matrix data structure for large-scale Hartree-Fock/Kohn-Sham calculations
✍ Emanuel H. Rubensson; Elias Rudberg; PaweΕ‚ SaΕ‚ek πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 597 KB

## Abstract A hierarchic sparse matrix data structure for Hartree‐Fock/Kohn‐Sham calculations is presented. The data structure makes the implementation of matrix manipulations needed for large systems faster, easier, and more maintainable without loss of performance. Algorithms for symmetric matrix