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