Résumé
It is well known that integers or polynomials can be multiplied in an asymptotically fast way using the discrete Fourier transform. In this paper, we give an analogue of fast Fourier multiplication in the ring of skew polynomials C[x,δ], where δ = x ∂/∂x. More precisely, we show that the multiplication problem of linear differential operators of degree n in x and degree n in δ can be reduced to the n × n matrix multiplication problem.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 123-127 |
| Nombre de pages | 5 |
| journal | Journal of Symbolic Computation |
| Volume | 33 |
| Numéro de publication | 1 |
| Les DOIs | |
| état | Publié - 1 janv. 2002 |
| Modification externe | Oui |
Empreinte digitale
Examiner les sujets de recherche de « FFT-like multiplication of linear differential operators ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver