Results 1 to 10 of about 1,202 (26)
An effective implementation of Strassen’s algorithm using AVX intrinsics for a multicore architecture [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2020 This paper proposes an effective implementation of Strassen’s algorithm with AVX intrinsics to augment matrix-matrix multiplication in a multicore system.
Nwe Zin Oo, Panyayot Chaikan
doaj +1 more source
Calculating the Moore–Penrose Generalized Inverse on Massively Parallel Systems
Algorithms, 2022 In this work, we consider the problem of calculating the generalized Moore–Penrose inverse, which is essential in many applications of graph theory.
Vukašin Stanojević +4 more
doaj +1 more source
A Method of Ultra-Large-Scale Matrix Inversion Using Block Recursion
Information, 2020 Ultra-large-scale matrix inversion has been applied as the fundamental operation of numerous domains, owing to the growth of big data and matrix applications.
HouZhen Wang, Yan Guo, HuanGuo Zhang
doaj +1 more source
On fast multiplication of a matrix by its transpose [PDF]
, 2020 We present a non-commutative algorithm for the multiplication of a 2x2-block-matrix by its transpose using 5 block products (3 recursive calls and 2 general products) over C or any finite field.We use geometric considerations on the space of bilinear ...
Dumas, Jean-Guillaume +2 more
core +3 more sources
A New Processing Approach for Reducing Computational Complexity in Cloud-RAN Mobile Networks
IEEE Access, 2018 Cloud computing is considered as one of the key drivers for the next generation of mobile networks (e.g. 5G). This is combined with the dramatic expansion in mobile networks, involving millions (or even billions) of subscribers with a greater number of ...
Ali M. Mahmood +2 more
doaj +1 more source
Conditional convex orders and measurable martingale couplings [PDF]
, 2015 Strassen's classical martingale coupling theorem states that two real-valued random variables are ordered in the convex (resp.\ increasing convex) stochastic order if and only if they admit a martingale (resp.\ submartingale) coupling.
Leskelä, Lasse, Vihola, Matti
core +1 more source
Fast integer multiplication using generalized Fermat primes [PDF]
, 2018 For almost 35 years, Sch{\"o}nhage-Strassen's algorithm has been the fastest algorithm known for multiplying integers, with a time complexity O(n $\times$ log n $\times$ log log n) for multiplying n-bit inputs. In 2007, F{\"u}rer proved that there exists
Covanov, Svyatoslav, Thomé, Emmanuel
core +4 more sources
Faster Algorithms for Rectangular Matrix Multiplication [PDF]
, 2012 Let {\alpha} be the maximal value such that the product of an n x n^{\alpha} matrix by an n^{\alpha} x n matrix can be computed with n^{2+o(1)} arithmetic operations.
Gall, François Le
core +1 more source
Fast matrix multiplication techniques based on the Adleman-Lipton model
, 2011 On distributed memory electronic computers, the implementation and association of fast parallel matrix multiplication algorithms has yielded astounding results and insights.
Nayebi, Aran
core +1 more source
F1000ResearchBackground Matrix Chain Multiplication (MCM) is a fundamental problem in computational mathematics and computer science, often encountered in scientific computing, graphics, and machine learning.
Srinivasarao Thota +2 more
doaj +1 more source