1,721,053 research outputs found
Parallel solution of Almost Block Diagonal systems on a Hypercube
No full textAbstractA new tearing-type approach toward the solution of Almost Block Diagonal Systems on distributed memory parallel computers is presented. Its arithmetical complexity is examined and compared with other existing approaches
A survey of parallel direct methods for block bidiagonal linear systems on distributed memory computers
No full textAbstractFour parallel algorithms for the solution of block bidiagonal linear systems on distributed memory computers are presented. All the algorithms belong to the class of direct methods. The first is a variant of the sequential algorithm and is suitable for a small number of processors. The remaining three algorithms are based on the parallel methods for banded systems and are much better suited for parallel computations on multiple processors. The arithmetical complexity functions of the proposed algorithms are derived. The results of experiments with the four algorithms implemented in Parallel Fortran on a linear array of 32 Transputers are presented and discussed
Utilizing recursive storage in sparse matrix-vector multiplication - preliminary considerations
No full text
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
On the usage of 16 bit indices in recursively stored sparse matrices
No full textIn our earlier work, we have investigated the feasibility of utilization of recursive partitioning in basic (BLAS oriented) sparse matrix computations, on multi-core cache-based computers. Following encouraging experimental results obtained for SpMV and SpSV operations, here we proceed to tune the storage format. To limit the memory bandwidth overhead we introduce usage of shorter (16 bit) indices in leaf sub matrices (at the end of the recursion). Experimental results obtained for the proposed approach on 8-core machines illustrate speed improvements, when performing sparse matrix-vector multiplication
- …
