Matrix Chain Multiplication

Michal Mankowski; Mikhail Moshkov

doi:10.1007/978-3-030-63920-4_5

Matrix Chain Multiplication

Michal Mankowski^*, Mikhail Moshkov

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

Matrix chain multiplication is one of the classic optimization problems in computer science. For a given sequence A₁, A₂, …, A_n of matrices, we need to compute the product of these matrices using the minimum number of scalar multiplications on a single processor machine.

Original language	English (US)
Title of host publication	Studies in Systems, Decision and Control
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	51-62
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-030-63920-4_5
State	Published - 2021

Publication series

Name	Studies in Systems, Decision and Control
Volume	331
ISSN (Print)	2198-4182
ISSN (Electronic)	2198-4190

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

ASJC Scopus subject areas

Computer Science (miscellaneous)
Control and Systems Engineering
Automotive Engineering
Social Sciences (miscellaneous)
Economics, Econometrics and Finance (miscellaneous)
Control and Optimization
Decision Sciences (miscellaneous)

Access to Document

10.1007/978-3-030-63920-4_5

Cite this

@inbook{2f89dfaa8df24a6db907d6c43d8fe32b,

title = "Matrix Chain Multiplication",

abstract = "Matrix chain multiplication is one of the classic optimization problems in computer science. For a given sequence A1, A2, …, An of matrices, we need to compute the product of these matrices using the minimum number of scalar multiplications on a single processor machine.",

author = "Michal Mankowski and Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.",

year = "2021",

doi = "10.1007/978-3-030-63920-4_5",

language = "English (US)",

series = "Studies in Systems, Decision and Control",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "51--62",

booktitle = "Studies in Systems, Decision and Control",

address = "Germany",

}

TY - CHAP

T1 - Matrix Chain Multiplication

AU - Mankowski, Michal

AU - Moshkov, Mikhail

PY - 2021

Y1 - 2021

N2 - Matrix chain multiplication is one of the classic optimization problems in computer science. For a given sequence A1, A2, …, An of matrices, we need to compute the product of these matrices using the minimum number of scalar multiplications on a single processor machine.

AB - Matrix chain multiplication is one of the classic optimization problems in computer science. For a given sequence A1, A2, …, An of matrices, we need to compute the product of these matrices using the minimum number of scalar multiplications on a single processor machine.

UR - http://www.scopus.com/inward/record.url?scp=85101339859&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-63920-4_5

DO - 10.1007/978-3-030-63920-4_5

M3 - Chapter

AN - SCOPUS:85101339859

T3 - Studies in Systems, Decision and Control

SP - 51

EP - 62

BT - Studies in Systems, Decision and Control

PB - Springer Science and Business Media Deutschland GmbH

ER -

Matrix Chain Multiplication

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this