Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons (Q4484796)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1454660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons |
scientific article; zbMATH DE number 1454660 |
Statements
Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons (English)
0 references
29 January 2001
0 references
Toeplitz matrices
0 references
polynomial arithmetic
0 references
polynomial factorization
0 references
cyclic reduction
0 references
Markov chains
0 references
algorithms
0 references
fast Fourier transforms
0 references
computational complexity
0 references
stability
0 references
0.7549070119857788
0 references
0.7497435808181763
0 references
0.742101788520813
0 references
