Results 21 to 30 of about 41,758 (261)
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
IEEE Access, 2020 Matrix computing is a basic operational model that was broadly used in science and engineering applications. In this study, we first propose a novel optimization method to obtain a high-performance and scalable architecture for matrix multiplication ...
Longlong Zhang +3 more
doaj +1 more source
Accelerating Batched Matrix Multiplication for Variable Small Sizes Based on TVM andApplications [PDF]
Jisuanji kexueIn many practical applications,efficient computation of a large amount of small matrix products across different dimensions is required.For instance,in graph classification tasks based on graph neural networks,multiple adjacency matrices need to be ...
DAI Hanwen, CHEN Changbo
doaj +1 more source
Context-free path querying with all-path semantics using matrices with sets of intermediate vertices [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2021 The study considers the problem of context-free path querying with all-path query semantics. This problem consists in finding all paths of the graph, the labels on the edges of which form words from the language generated by the input context-free ...
Rustam Sh. Azimov, Semyon V. Grigorev
doaj +1 more source
Fast Matrix Multiplication [PDF]
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, 2015 Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729).
Andris Ambainis +2 more
openaire +2 more sources
A practical streaming approximate matrix multiplication algorithm
Journal of King Saud University: Computer and Information Sciences, 2022 Approximate Matrix Multiplication (AMM) has emerged as a useful and computationally inexpensive substitute for actual multiplication of large matrices. Randomized as well as deterministic solutions to AMM were provided in the past.
Deena P. Francis, Kumudha Raimond
doaj +1 more source
Multiplication of medium-density matrices using TensorFlow on multicore CPUs
Tehnički Glasnik, 2019 Matrix multiplication is an essential part of many applications, such as linear algebra, image processing and machine learning. One platform used in such applications is TensorFlow, which is a machine learning library whose structure is based on dataflow
Siraphob Theeracheep +1 more
doaj +1 more source
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure [PDF]
Journal of Sciences, Islamic Republic of Iran, 2010 The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube
L Jokar
doaj
Cogent Engineering, 2017 Matrix Multiplication is a basic engineering and scientific problem, which has application in various domains. There exists many cryptographic solutions for secure computation of matrix multiplication, but cryptographic preamble makes them infeasible for
Malay Kumar, Jasraj Meena, Manu Vardhan
doaj +1 more source