An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

DOI10.1137/0225039MaRDI QIDQ4895834zbMATH OpenOpenAlexFDO

Authors Prakash V. Ramanan

Publication date 3 March 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0225039

zbMATH Keywords

parallel random-access machinedynamic-programming algorithmsmatrix-chain product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Publication:4206296
• scientific article; zbMATH DE number 512836
• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
• Parallel algorithms for certain matrix computations
• Very Fast Approximation of the Matrix Chain Product Problem
• scientific article; zbMATH DE number 641618
• scientific article; zbMATH DE number 1262869
• scientific article; zbMATH DE number 815482

Cited in

(13)

• scientific article; zbMATH DE number 4126588 (Why is no real title available?)
• Revisiting ``Computation of matrix chain products
• Computation of Matrix Chain Products. Part II
• A faster parallel algorithm for a matrix searching problem
• A Parallel and Vector Variant of the Cyclic Reduction Algorithm
• On efficient parallel computations for some dynamic programming problems
• An approximation algorithm for the matrix tree multiplication problem
• scientific article; zbMATH DE number 822184 (Why is no real title available?)
• On Efficient Parallel Algorithms for Solving Set Recurrence Equations
• A faster parallel algorithm for a matrix searching problem
• Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
• Sequential optimization of matrix chain multiplication relative to different cost functions
• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications

This page was built for publication: An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

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