Results 1 to 10 of about 48 (47)

Hybrid optimization technique for matrix chain multiplication using Strassen’s algorithm [version 2; peer review: 3 approved, 1 approved with reservations] [PDF]

open access: yesF1000Research
Background 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   +2 more sources

An effective implementation of Strassen’s algorithm using AVX intrinsics for a multicore architecture [PDF]

open access: yesSongklanakarin 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

open access: yesAlgorithms, 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

open access: yesInformation, 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

A New Processing Approach for Reducing Computational Complexity in Cloud-RAN Mobile Networks

open access: yesIEEE 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

Hybrid optimization technique for matrix chain multiplication using Strassen’s algorithm [version 1; peer review: 2 approved, 1 approved with reservations]

open access: yesF1000Research
Background 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

Design and implementation of a parallel system based on FPGA resources

open access: yesDianzi Jishu Yingyong
Addressing the challenge of low development efficiency in the heterogeneous resource architecture combining general-purpose CPUs and Field Programmable Gate Arrays (FPGAs), a novel proxy-based thread management framework is proposed by leveraging ...
Liu Hongwei   +5 more
doaj   +1 more source

On Invertibility of Large Binary Matrices

open access: yesMathematics
Many data processing applications involve binary matrices for storing digital information. At present, there are limited results in the literature about algorithms for inverting large binary matrices.
Ibrahim Mammadov   +2 more
doaj   +1 more source

Full Precision Hardware Implementation of the AlphaEvolve 4×4 Complex Valued Matrix Multiplication Algorithm

open access: yesIEEE Access
Matrix multiplication is a fundamental operation across many domains. For $4\times 4$ matrices, the naive algorithm requires 64 multiplications, while Strassen’s method reduces this to 49.
Ettore Napoli
doaj   +1 more source

Investigation of Energy and Power Characteristics of Various Matrix Multiplication Algorithms

open access: yesEnergies
This work studied the energy behavior of six matrix multiplication algorithms with various physical asset usage patterns. Two were variants of the straight inner product of rows and columns. The rest were variants of Strassen’s divide-and-conquer.
Salem Alsari, Muhammad Al-Hashimi
doaj   +1 more source

Home - About - Disclaimer - Privacy