An O(n) algorithm for determining a near-optimal computation order of matrix chain products

DOI10.1145/359545.359556zbMATH Open0377.15005OpenAlexW2041094700MaRDI QIDQ4156871FDOQ4156871

Francis Y. L. Chin

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359545.359556

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Cited In (4)

• Lower bounds for the matrix chain ordering problem
• Dynamic programming and graph optimization problems
• Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications

This page was built for publication: An O(n) algorithm for determining a near-optimal computation order of matrix chain products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156871)