Filters
Generator of random large sparse matrices with given properties
This work describes the design and implementation of a sparse matrix generator. One of the goals was to provide a simple user interface and many possible settings of matrix parameters, including the generation of various types of matrice...
JC - Počítačový hardware a software
- 2010 •
- R •
- Link
Rok uplatnění
R - Software
Výsledek na webu
Large-Scale Visualization of Sparse Matrices
the proposed algorithm, one can thus visualize large sparse matrices with a minimal runtimeAn efficient algorithm for parallel acquisition of visualization data for large sparse matrices is prese...
IN - Informatika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Space-efficient sparse matrix storage formats with 8-bit indices
The paper is aimed at space-efficient storage formats for very large sparse matrices (VLSMs). By VLSMs, we mean matrices that because of their size must be stored and processed by massively parallel computer system...
IN - Informatika
- 2012 •
- D
Rok uplatnění
D - Stať ve sborníku
Parallel Data Acquisition for Visualization of Very Large Sparse Matrices
The problem of visualization of very large sparse matrices emerging on massively parallel computer systems is identified and a new method along with an accompanying algorithm for parallel acquisition of visualization data f...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Sparse binary matrices
in computers grows very rapidly, there are still matrices that are bigger than available memory. But many of these matrices are sparse, so that storage only non-zero values can solve the problem. Special case of sparse...
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Algorithm for Elimination of Systems with Sparse Asymmetric Reducible Matrices.
In the paper, an algorithm for finding an optimal or almost optimal permutation for an ordering of elements of a matrix, which is sparse, asymmetric and reducible, is suggested. Using this algorithm we can solve large sparse
BA - Obecná matematika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Scalable Parallel Generation of Very Large Sparse Benchmark Matrices
generation of sparse matrices intended primarily for benchmarking purposes, namely that involvesparse matrices. The proposed method is based on enlargement of small input matrices, which are supposed to be obtaine...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A pathfollowing technique for the analytic singular value decomposition
The aim is to compute ASVD for large sparse matrices. In particular we consider branches of selected singular values and the corresponding left/right singular vectors. We apply a predictor-corrector algorithm with an adapti...
BA - Obecná matematika
- 2005 •
- O
Rok uplatnění
O - Ostatní výsledky
Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures
Very large sparse matrices are often processed on massively parallel computer systems with distributed memory architectures consisting of tens or hundreds these matrices from/to a distributed file system. This pape...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Downsampling Algorithms for Large Sparse Matrices
Mapping of sparse matrices to processors of a parallel system may have a significant impact on the development of sparse-matrix algorithms and, in effect, to their efficiency. We present and empirically compare two downsamp...
IN - Informatika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 61 592