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 language | English |
---|---|
Title of host publication | Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 |
Editors | Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Viorel Negru, Daniela Zaharie |
Publisher | IEEE |
Pages | 67-70 |
Number of pages | 4 |
ISBN (Electronic) | 9781538626269 |
DOIs | |
Publication status | Published - 12 Nov 2018 |
Event | 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 - Timisoara, Romania Duration: 21 Sept 2017 → 24 Sept 2017 |
Conference
Conference | 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 |
---|---|
Country/Territory | Romania |
City | Timisoara |
Period | 21/09/17 → 24/09/17 |
Funding
ACKNOWLEDGMENT We are grateful for support by the Bath Institute for Mathematical Innovation and the H2020-FETOPEN-2016-2017-CSA project SC2 (712689).
Keywords
- Fast matrix
- Inversion
- Matrices
- Multiplication
ASJC Scopus subject areas
- Computational Mathematics
- Computational Theory and Mathematics
- Software
Fingerprint
Dive into the research topics of 'Fast Matrix Operations in Computer Algebra'. Together they form a unique fingerprint.Datasets
-
Data for 'Fast Matrix Operations in Computer Algebra'
Tonks, Z. (Creator), Davenport, J. (Editor) & Sankaran, G. (Editor), University of Bath, 13 Dec 2017
DOI: 10.15125/BATH-00460
Dataset