<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Cariow, A.</creatorName>
<affiliation>West Pomeranian University of Technology of Szczecin, Poland, Polonia</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Fast algorithms: a science, an art, and a craft</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2018</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-9975-45-540-4</relatedIdentifier>
<subjects>
<subject>Fast algorithms</subject>
<subject>matrix-vector multiplication</subject>
<subject>digital signal processing</subject>
</subjects>
<dates>
<date dateType='Issued'>2018</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>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.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>