Hybrid optimization technique for matrix chain multiplication using Strassen's algorithm.

Journal: F1000Research
Published Date: May 27, 2025

Abstract

BACKGROUND: 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 scalar multiplications. However, standard matrix multiplication still operates in O(n ) time complexity, leading to inefficiencies for large matrices.

Authors

  • Srinivasarao Thota
    Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Amaravati, Andhra Pradesh, 522503, India.
  • Thulasi Bikku
    Department of Computer Science and Engineering, Amrita School of Computing, Amrita Vishwa Vidyapeetham, Amaravati, Andhra Pradesh, 522503, India.
  • Rakshitha T
    Department of Mathematics, Eritrea Institute of Technology, Abardae, Eritrea.

Keywords

External Resources

Popular Topics
Recent Journals