Abstract:
The multiplication algorithm for dense and sparse polynomials and polynomial matrices of different numerical domains are investigated. The expressions for complexity of multiplication operations of polynomials and polynomial matrices are obtained. Each of these expressions is an average of distribution for machine arithmetic operation numbers. Expressions of complexity for a set of parameters which has a practical interest are presented. The results of experiments with the respective programs are demonstrated. Bibl. – 8 titles.
Key words and phrases:algorithms of polynomial multiplication, akgorithms of matrix multiplication, polynomial matrix, Karatsubs's algorithm. Shtrassen's algorithm, modular algorithms, fast Fourier transform.
Fulltext:
PDF file (344 kB)