Fast algorithms: a science, an art, and a craft
Închide
Articolul precedent
Articolul urmator
640 9
Ultima descărcare din IBN:
2020-04-28 22:13
SM ISO690:2012
CARIOW, Aleksandr. Fast algorithms: a science, an art, and a craft. In: Telecommunications, Electronics and Informatics, Ed. 6, 24-27 mai 2018, Chișinău. Chișinău, Republica Moldova: 2018, Ed. 6, pp. 249-251. ISBN 978-9975-45-540-4.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Telecommunications, Electronics and Informatics
Ed. 6, 2018
Conferința "Telecommunications, Electronics and Informatics"
6, Chișinău, Moldova, 24-27 mai 2018

Fast algorithms: a science, an art, and a craft


Pag. 249-251

Cariow Aleksandr
 
West Pomeranian University of Technology of Szczecin, Poland
 
Disponibil în IBN: 31 mai 2018


Rezumat

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.

Cuvinte-cheie
Fast algorithms, matrix-vector multiplication,

digital signal processing

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-62632</cfResPublId>
<cfResPublDate>2018</cfResPublDate>
<cfVol>Ed. 6</cfVol>
<cfStartPage>249</cfStartPage>
<cfISBN>978-9975-45-540-4</cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/62632</cfURI>
<cfTitle cfLangCode='RO' cfTrans='o'>Fast algorithms: a science, an art, and a craft</cfTitle>
<cfKeyw cfLangCode='RO' cfTrans='o'>Fast algorithms; matrix-vector multiplication; digital signal processing</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><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></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-58612</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-58612</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-58612-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
<cfFamilyNames>Cariow</cfFamilyNames>
<cfFirstNames>Aleksandr</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>