Results 11 to 20 of about 1,720,417 (290)
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication [PDF]
AlgorithmicaKarppa & Kaski (2019) proposed a novel ``broken" or ``opportunistic" matrix multiplication algorithm, based on a variant of Strassen's algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks. Their algorithm can compute Boolean matrix multiplication in $O(n^{2.778})$ time.
Harris, David G.
openaire +7 more sources
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2017 In this paper, a new matrix multiplication is defined in Rm;nRn;pby using scalar product in Rn, where Rm;nis set of matrices of m rows and n columns. With this multiplication it has been shown that Rn;nis an algebra with unit. By considering this new multiplication we define eigenvalues and eigen vectors of square n n matrix A and also present some ...
KEÇİLİOĞLU, Osman, GÜNDOĞAN, Halit
openaire +3 more sources
The scheduling of sparse matrix-vector multiplication on a massively parallel dap computer [PDF]
, 1991 An efficient data structure is presented which supports general unstructured sparse matrix-vector multiplications on a Distributed Array of Processors (DAP). This approach seeks to reduce the inter-processor data movements and organises the operations in
Mitra, G, Parkinson, D, Andersen, J
core +6 more sources
Fast Kronecker Matrix-Matrix Multiplication on GPUs [PDF]
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel ProgrammingKronecker Matrix-Matrix Multiplication (Kron-Matmul) is the multiplication of a matrix with the Kronecker Product of several smaller matrices. Kron-Matmul is a core operation for many scientific and machine learning computations. State-of-the-art Kron-Matmul implementations utilize existing tensor algebra operations, such as matrix multiplication ...
Abhinav Jangda, Mohit Yadav
openaire +4 more sources
Matrix multiplication via matrix groups
CoRR, 2022 15 ...
Jonah Blasiak +4 more
openaire +6 more sources
On sunflowers and matrix multiplication [PDF]
computational complexity, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon +2 more
openaire +6 more sources
Matrix-matrix multiplication on heterogeneous platforms [PDF]
Proceedings 2000 International Conference on Parallel Processing, 2002 In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of workstations, and collections of heterogeneous clusters.
Beaumont, Olivier +3 more
openaire +2 more sources
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication [PDF]
SIAM Journal on Scientific Computing, 2016 Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication.
Ariful Azad +7 more
openaire +9 more sources
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication [PDF]
, 2023 Karppa & Kaski (2019) proposed a novel ``broken or ``opportunistic matrix multiplication algorithm, based on a variant of Strassen\u27s algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks.
Harris, David G.
core +1 more source
Local Re-Encoding for Coded Matrix Multiplication
IEEE Open Journal of the Communications Society, 2022 Matrix multiplication is a fundamental operation in various algorithms for big data analytics and machine learning. As the size of the dataset increases rapidly, it is now a common practice to distribute the computation on multiple servers. As straggling
Xian Su +4 more
doaj +1 more source