Hybrid optimization technique for matrix chain multiplication using Strassen’s algorithm [version 2; peer review: 3 approved, 1 approved with reservations] [PDF]
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 +5 more sources
Faster quantum subroutine for matrix chain multiplication via Chebyshev approximation [PDF]
Scientific ReportsMatrix operations are crucial to various computational tasks in various fields, and quantum computing offers a promising avenue to accelerate these operations. We present a quantum matrix multiplication (QMM) algorithm that employs amplitude encoding and
Xinying Li +5 more
doaj +4 more sources
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 +4 more sources
Optimal sequence for chain matrix multiplication using evolutionary algorithm [PDF]
PeerJ Computer Science, 2021 The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM).
Umer Iqbal +7 more
doaj +4 more sources
Matrix-Chain Multiplication Based on Combinatorial Allosteric DNA Strand Displacement
IEEE AccessDNA computing has gained widespread attention for leveraging the unique properties of DNA molecules to perform computational operations. As a fundamental tool for analyzing data and optimizing models, matrix operation plays an important role in intensive
Hengyan Guo +2 more
doaj +2 more sources
Challenges in Parallel Matrix Chain Multiplication
Lecture Notes in Computer ScienceAbstractMatrix chain multiplication is widely used in high-performance computing environments. Different parenthesis assignments, which determine the multiplication order, produce the same output but may significantly affect the runtime. Thus, finding the optimal parentheses assignment is crucial. Several algorithms, such as Godbole (1973) and Hu &
Oded Schwartz, Roy Nissim
exaly +2 more sources
Hybrid optimization technique for matrix chain multiplication using Strassen’s algorithm
F1000ResearchBackground: Matrix Chain Multiplication (MCM) is a fundamental problem in computational mathematics and computer science, often encountered in scientific computing, graphics, and machine learning. Traditional MCM optimization techniques use Dynamic Programming (DP) with Memoization to determine the optimal parenthesization for minimizing the number of ...
Thulasi Bikku, Srinivasarao Thota
exaly +4 more sources
Research on I-M Model of Supply Chain Risk Path Identification [PDF]
SHS Web of Conferences, 2023 Through literature analysis and expert interviews, 15 factors affecting the development of the supply chain finance industry were identified, and the ISM method was used to construct a hierarchical structure chart of the factors, so as to analyze the ...
Yan Chengren
doaj +1 more source
Development of an Educational Code of Deriving Equations of Motion and Analyzing Dynamic Characteristics of Multibody Closed Chain Systems using GNU Octave for a Beginner [PDF]
Journal of Applied and Computational Mechanics, 2022 In this study, an automatic GNU Octave code, a free high-level language, for the educational purposes was developed to derive equations of motion and constrain equations of a multibody closed chain system and to calculate the response of the system.
Y.H. Park
doaj +1 more source
Enhanced Matrix Chain Multiplication [PDF]
Journal of Cyber Security and Mobility, 2018 Let A1, A2,....An be the given sequence of n matrices, generally matrix chain multiplication algorithm is used to obtain its-product with minimum cost(lowest cost). However the matrix chain multiplication is a dynamic programming paradigm and takes O(n3) computational complexity.
B. Suvarna, T. Maruthi Padmaja
openaire +3 more sources