Journal ArticleDOI
Fast algorithm for sparse matrix multiplication
TLDR
A fast algorithm for the multiplication of two sparse matrices, whose average time complexity is an order of magnitude better than that of standard known algorithms, and which is able to avoid the additional unnecessary index comparisons, thus only requiring O(D,D&NK) time.About:
This article is published in Information Processing Letters.The article was published on 1982-09-06. It has received 7 citations till now. The article focuses on the topics: Freivalds' algorithm & Multiplication algorithm.read more
Citations
More filters
Journal ArticleDOI
Processor allocation and task scheduling of matrix chain products on parallel systems
TL;DR: A new processor scheduling algorithm for MCSP is introduced which reduces the evaluation time of a chain of matrix products on a parallel computer, even at the expense of a slight increase in the total number of operations.
Journal ArticleDOI
On why an algorithmic time complexity measure can be system invariant rather than system independent
TL;DR: It is argued that it suffices for an algorithmic time complexity measure to be system invariant rather than system independent (which means predicting from the desk) instead of being system independent.
Journal ArticleDOI
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
TL;DR: This paper design and analyse two optimal O( n ) greedy algorithms leading in general to different optimal solutions i.e. chain parenthesizations and establishes a comparison between these two algorithms based on the parallel computing of the matrix chain product through intra and inter-subchains coarse grain parallelism.
Posted ContentDOI
Empirical and statistical comparison of intermediate steps of AES-128 and RSA in terms of time consumption
TL;DR: The weight factor is used to determine the complexity of an algorithm with many operating functions working simultaneously and has taken time of the operation as a measure of the weight factor.
Journal ArticleDOI
Skew-sparse matrix multiplication
TL;DR: A deterministic algorithm with complexity O( T ω − 2 p 2 ), where T ≤ p − 1 is a parameter determined by the skew-sparsity of input matrices and ω is the asymptotic exponent of matrix multiplication.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
Effect of data representation on cost of sparse matrix operations
TL;DR: The cost of each matrix operation is reported analytically as a function of the matrix representation used, the matrix densities, and the speeds of floating point addition and multiplication relative to fixed point operations.