{"id":"https://openalex.org/W2593959076","doi":"https://doi.org/10.1080/00207160.2017.1294252","title":"Automatic generation of fast algorithms for matrix\u2013vector multiplication","display_name":"Automatic generation of fast algorithms for matrix\u2013vector multiplication","publication_year":2017,"publication_date":"2017-03-16","ids":{"openalex":"https://openalex.org/W2593959076","doi":"https://doi.org/10.1080/00207160.2017.1294252","mag":"2593959076"},"language":"en","primary_location":{"id":"doi:10.1080/00207160.2017.1294252","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2017.1294252","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033424679","display_name":"Bartosz Andreatto","orcid":null},"institutions":[{"id":"https://openalex.org/I155313962","display_name":"West Pomeranian University of Technology","ror":"https://ror.org/0596m7f19","country_code":"PL","type":"education","lineage":["https://openalex.org/I155313962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"B. Andreatto","raw_affiliation_strings":["Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland","institution_ids":["https://openalex.org/I155313962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019629900","display_name":"Aleksandr Cariow","orcid":"https://orcid.org/0000-0002-4513-4593"},"institutions":[{"id":"https://openalex.org/I155313962","display_name":"West Pomeranian University of Technology","ror":"https://ror.org/0596m7f19","country_code":"PL","type":"education","lineage":["https://openalex.org/I155313962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"A. Cariow","raw_affiliation_strings":["Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland","institution_ids":["https://openalex.org/I155313962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033424679"],"corresponding_institution_ids":["https://openalex.org/I155313962"],"apc_list":null,"apc_paid":null,"fwci":0.4542,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63101341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"95","issue":"3","first_page":"626","last_page":"644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9732000231742859,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9724000096321106,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7138025164604187},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.589011013507843},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.548261821269989},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5304182171821594},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5053561329841614},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.47267040610313416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4597509205341339},{"id":"https://openalex.org/keywords/lu-decomposition","display_name":"LU decomposition","score":0.41966211795806885},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4103337228298187},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.3982384502887726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3941447138786316},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.11853206157684326}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7138025164604187},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.589011013507843},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.548261821269989},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5304182171821594},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5053561329841614},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.47267040610313416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4597509205341339},{"id":"https://openalex.org/C123213974","wikidata":"https://www.wikidata.org/wiki/Q833089","display_name":"LU decomposition","level":4,"score":0.41966211795806885},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4103337228298187},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.3982384502887726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3941447138786316},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.11853206157684326},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160.2017.1294252","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2017.1294252","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W220932839","https://openalex.org/W252853867","https://openalex.org/W621643794","https://openalex.org/W1553437616","https://openalex.org/W2013090149","https://openalex.org/W2024381286","https://openalex.org/W2073061372","https://openalex.org/W2122410182","https://openalex.org/W2152903294","https://openalex.org/W2163491234","https://openalex.org/W4239894305","https://openalex.org/W4246182238","https://openalex.org/W4253729258","https://openalex.org/W4301056670","https://openalex.org/W4301621763"],"related_works":["https://openalex.org/W2125326641","https://openalex.org/W2001342884","https://openalex.org/W2293771254","https://openalex.org/W4221142455","https://openalex.org/W1988437637","https://openalex.org/W3121828480","https://openalex.org/W2039875226","https://openalex.org/W4386792722","https://openalex.org/W2032786851","https://openalex.org/W4386764095"],"abstract_inverted_index":{"This":[0],"paper":[1,101],"describes":[2],"the":[3,14,18,28,39,43,47,59,68,93],"methods":[4,23,61,97],"for":[5,9,87],"finding":[6,64],"fast":[7],"algorithms":[8],"computing":[10],"matrix\u2013vector":[11],"products":[12],"including":[13],"procedures":[15],"based":[16,37],"on":[17,38],"block-structured":[19,82],"matrices.":[20,32],"The":[21,33,55,84,96],"proposed":[22,60],"involve":[24],"an":[25,80],"analysis":[26],"of":[27,31,58,67,92],"structural":[29],"properties":[30],"presented":[34,98],"approaches":[35],"are":[36],"well-known":[40],"optimization":[41],"techniques:":[42],"simulated":[44],"annealing":[45],"and":[46,75],"hill-climbing":[48],"algorithm":[49],"along":[50],"with":[51],"its":[52],"several":[53],"extensions.":[54],"main":[56,85],"idea":[57],"consists":[62],"in":[63,99,106],"a":[65,72,76,90],"decomposition":[66],"original":[69],"matrix":[70,74,77],"into":[71],"sparse":[73],"corresponding":[78],"to":[79],"appropriate":[81],"pattern.":[83],"criterion":[86],"optimizing":[88],"is":[89],"reduction":[91],"computational":[94],"cost.":[95],"this":[100],"can":[102],"be":[103],"successfully":[104],"implemented":[105],"many":[107],"digital":[108],"signal":[109],"processing":[110],"tasks.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
