@inproceedings{5783b0570f334c9cab70746c28fddb8c,
title = "Efficient evaluation of matrix polynomials",
abstract = "We revisit the problem of evaluating matrix polynomials and introduce memory and communication efficient algorithms. Our algorithms, based on that of Patterson and Stockmeyer, are more efficient than previous ones, while being as memory-efficient as Van Loan{\textquoteright}s variant. We supplement our theoretical analysis of the algorithms, with matching lower bounds and with experimental results showing that our algorithms outperform existing ones.",
keywords = "Cache efficiency, Matrix polynomials, Polynomial evaluation",
author = "Niv Hoffman and Oded Schwartz and Sivan Toledo",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.; 12th International Conference on Parallel Processing and Applied Mathematics, PPAM 2017 ; Conference date: 10-09-2017 Through 13-09-2017",
year = "2018",
doi = "10.1007/978-3-319-78024-5\_3",
language = "الإنجليزيّة",
isbn = "9783319780238",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "24--35",
editor = "Jack Dongarra and Roman Wyrzykowski and Konrad Karczewski and Ewa Deelman",
booktitle = "Parallel Processing and Applied Mathematics - 12th International Conference, PPAM 2017, Revised Selected Papers",
address = "ألمانيا",
}