Abstract

There has been surprisingly little written about the practical use of Strassenâ€'Winograd (as opposed to interpolation-based, and therefore oriented towards matrices of dense polynomials) fast matrix methods in computer algebra. We show that Strassenâ€'Winograd multiplication can be practically effective. We also derive a fraction-free method of fast matrix inversion, and investigate its efficiency.

Original languageEnglish
Title of host publicationProceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017
EditorsTetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Viorel Negru, Daniela Zaharie
PublisherIEEE
Pages67-70
Number of pages4
ISBN (Electronic)9781538626269
DOIs
Publication statusPublished - 9 Nov 2018
Event19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 - Timisoara, Romania
Duration: 21 Sep 201724 Sep 2017

Conference

Conference19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017
CountryRomania
CityTimisoara
Period21/09/1724/09/17

Keywords

  • Fast matrix
  • Inversion
  • Matrices
  • Multiplication

ASJC Scopus subject areas

  • Computational Mathematics
  • Computational Theory and Mathematics
  • Software

Cite this

Tonks, Z., Sankaran, G., & Davenport, J. H. (2018). Fast matrix operations in computer algebra. In T. Ida, T. Jebelean, D. Petcu, S. M. Watt, V. Negru, & D. Zaharie (Eds.), Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 (pp. 67-70). [8531267] IEEE. https://doi.org/10.1109/SYNASC.2017.00021

Fast matrix operations in computer algebra. / Tonks, Zak; Sankaran, Gregory; Davenport, James H.

Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017. ed. / Tetsuo Ida; Tudor Jebelean; Dana Petcu; Stephen M. Watt; Viorel Negru; Daniela Zaharie. IEEE, 2018. p. 67-70 8531267.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tonks, Z, Sankaran, G & Davenport, JH 2018, Fast matrix operations in computer algebra. in T Ida, T Jebelean, D Petcu, SM Watt, V Negru & D Zaharie (eds), Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017., 8531267, IEEE, pp. 67-70, 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017, Timisoara, Romania, 21/09/17. https://doi.org/10.1109/SYNASC.2017.00021
Tonks Z, Sankaran G, Davenport JH. Fast matrix operations in computer algebra. In Ida T, Jebelean T, Petcu D, Watt SM, Negru V, Zaharie D, editors, Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017. IEEE. 2018. p. 67-70. 8531267 https://doi.org/10.1109/SYNASC.2017.00021
Tonks, Zak ; Sankaran, Gregory ; Davenport, James H. / Fast matrix operations in computer algebra. Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017. editor / Tetsuo Ida ; Tudor Jebelean ; Dana Petcu ; Stephen M. Watt ; Viorel Negru ; Daniela Zaharie. IEEE, 2018. pp. 67-70
@inproceedings{4419c3e030b54a5e8802aef2744a36f2,
title = "Fast matrix operations in computer algebra",
abstract = "There has been surprisingly little written about the practical use of Strassen{\^a}€'Winograd (as opposed to interpolation-based, and therefore oriented towards matrices of dense polynomials) fast matrix methods in computer algebra. We show that Strassen{\^a}€'Winograd multiplication can be practically effective. We also derive a fraction-free method of fast matrix inversion, and investigate its efficiency.",
keywords = "Fast matrix, Inversion, Matrices, Multiplication",
author = "Zak Tonks and Gregory Sankaran and Davenport, {James H.}",
year = "2018",
month = "11",
day = "9",
doi = "10.1109/SYNASC.2017.00021",
language = "English",
pages = "67--70",
editor = "Tetsuo Ida and Tudor Jebelean and Dana Petcu and Watt, {Stephen M.} and Viorel Negru and Daniela Zaharie",
booktitle = "Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017",
publisher = "IEEE",
address = "USA United States",

}

TY - GEN

T1 - Fast matrix operations in computer algebra

AU - Tonks, Zak

AU - Sankaran, Gregory

AU - Davenport, James H.

PY - 2018/11/9

Y1 - 2018/11/9

N2 - There has been surprisingly little written about the practical use of Strassenâ€'Winograd (as opposed to interpolation-based, and therefore oriented towards matrices of dense polynomials) fast matrix methods in computer algebra. We show that Strassenâ€'Winograd multiplication can be practically effective. We also derive a fraction-free method of fast matrix inversion, and investigate its efficiency.

AB - There has been surprisingly little written about the practical use of Strassenâ€'Winograd (as opposed to interpolation-based, and therefore oriented towards matrices of dense polynomials) fast matrix methods in computer algebra. We show that Strassenâ€'Winograd multiplication can be practically effective. We also derive a fraction-free method of fast matrix inversion, and investigate its efficiency.

KW - Fast matrix

KW - Inversion

KW - Matrices

KW - Multiplication

UR - http://www.scopus.com/inward/record.url?scp=85058316323&partnerID=8YFLogxK

U2 - 10.1109/SYNASC.2017.00021

DO - 10.1109/SYNASC.2017.00021

M3 - Conference contribution

SP - 67

EP - 70

BT - Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017

A2 - Ida, Tetsuo

A2 - Jebelean, Tudor

A2 - Petcu, Dana

A2 - Watt, Stephen M.

A2 - Negru, Viorel

A2 - Zaharie, Daniela

PB - IEEE

ER -