eKMAIR

Algebraic and algorithmic classification of matrix algorithms [electronic resourse]

Show simple item record

dc.contributor.author Malaschonok, Gennadi
dc.date.accessioned 2022-06-23T11:10:51Z
dc.date.available 2022-06-23T11:10:51Z
dc.date.issued 2021
dc.identifier.citation Malaschonok G. I., Algebraic and algorithmic classification of matrix algorithms [electronic resourse] / G. Malaschonok // Seminar on Computer Algebra of Faculty of Computational Mathematics and Cybernetics of MSU, and Computing Centre of RAS (March 30, 2021) - 43 slides. en_US
dc.identifier.uri http://ekmair.ukma.edu.ua/handle/123456789/23136
dc.description.abstract Due to the growing size of the matrices used in applications, it is useful to carefully distinguish between some groups of matrix algorithms. We propose to use algebraic classi cation as the main way to group matrix algorithms. From an algorithmic point of view, we propose to highlight the class of block-recursive algorithms. These algorithms make it possible to ensure a uniform load of a computing cluster, to solve the problem of protecting against failure of its individual nodes, and, in addition, they have the complexity of matrix multiplication. en_US
dc.language.iso en uk_UA
dc.subject matrix en_US
dc.subject algebraic and algorithmic classi cation en_US
dc.subject matrix algorithms en_US
dc.subject block-recursive algorithms en_US
dc.subject matrix multiplication en_US
dc.subject conference materials en_US
dc.title Algebraic and algorithmic classification of matrix algorithms [electronic resourse] en_US
dc.type Conference materials uk_UA
dc.status first published uk_UA
dc.relation.source Seminar on Computer Algebra of Faculty of Computational Mathematics and Cybernetics of MSU, and Computing Centre of RAS (March 30, 2021). en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account

Statistics