Results 41 to 50 of about 2,725,619 (370)
Group-theoretic algorithms for matrix multiplication [PDF]
, 2005 We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm.
Cohn, Henry +3 more
core +3 more sources
Compressed matrix multiplication [PDF]
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012 We present a simple algorithm that approximates the product of n -by- n real matrices A and B . Let ‖AB‖ F denote the Frobenius norm of AB , and b
openaire +2 more sources
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier [PDF]
International Symposium on Information Theory, 2020 In distributed matrix multiplication, a common scenario is to assign each worker a fraction of the multiplication task, by partitioning the input matrices into smaller submatrices.
Qian Yu, A. Avestimehr
semanticscholar +1 more source
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 +2 more sources
Hierarchical Coded Matrix Multiplication [PDF]
IEEE Transactions on Information Theory, 2019 In distributed computing systems slow working nodes, known as stragglers, can greatly extend finishing times. Coded computing is a technique that enables straggler-resistant computation. Most coded computing techniques presented to date provide robustness by ensuring that the time to finish depends only on a set of the fastest nodes.
Shahrzad Kianidehkordi +2 more
openaire +4 more sources
Asymptotic tensor rank of graph tensors: beyond matrix multiplication [PDF]
, 2019 We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on $k$ vertices.
Christandl, Matthias +2 more
core +4 more sources
Fast Sparse Matrix Multiplication [PDF]
ACM Transactions on Algorithms, 2004 Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m nonzero elements. We present a new algorithm that multiplies A and
Raphael Yuster, Uri Zwick
openaire +1 more source
Applied Sciences, 2023 Intelligence development has put forward increasing requirements of real-time planning and dynamic feedback in controlling robotic arms. It has become essential in engineering applications to complete the kinematics calculation of complex manipulators in
Jiyang Yu +4 more
doaj +1 more source
Plethysm and fast matrix multiplication [PDF]
, 2018 Motivated by the symmetric version of matrix multiplication we study the plethysm $S^k(\mathfrak{sl}_n)$ of the adjoint representation $\mathfrak{sl}_n$ of the Lie group $SL_n$.
Seynnaeve, Tim
core +3 more sources
Entropy Games and Matrix Multiplication Games [PDF]
, 2015 Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-half players: Despot, Tribune and the non-deterministic People.
Asarin, Eugene +5 more
core +4 more sources