Fast Algorithms: a Science, an Art, and a Craft

dc.contributor.author	CARIOW, Aleksandr
dc.date.accessioned	2020-05-05T11:34:43Z
dc.date.available	2020-05-05T11:34:43Z
dc.date.issued	2018
dc.identifier.citation	CARIOW, Aleksandr. Fast Algorithms: a Science, an Art, and a Craft. In: Telecomunicaţii, Electronică şi Informatică: proc. of the 6th intern. conf., May 24-27, 2018. Chişinău, 2018, pp. 249-251. ISBN 978-9975-45-540-4.	en_US
dc.identifier.isbn	978-9975-45-540-4
dc.identifier.uri	http://repository.utm.md/handle/5014/8082
dc.description.abstract	This paper offers the strategies for the synthesis of fast algorithms for computing the matrix-vector products. The concrete example of synthesis of fast algorithm for matrix-vector multiplication is demonstrated in the speech. The example offered allows to track all the stages of construction of the algorithm which was rationalized from the point of view of number multiplication minimization. It is claimed that the process of constructing fast algorithms is both a science and an art and a craft.	en_US
dc.language.iso	en	en_US
dc.publisher	Tehnica UTM	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	fast algorithms	en_US
dc.subject	matrix-vector multiplication	en_US
dc.subject	digital signal processing	en_US
dc.title	Fast Algorithms: a Science, an Art, and a Craft	en_US
dc.type	Article	en_US