Abstract
We first modify the known FFT based algorithm for approximate polynomial division (which is equivalent to inversion of triangular Toeplitz matrices) by replacing FFT by DST, Discrete Sine Transform. The algorithm remains as fast as before but avoids involving nonreal numbers where the input is real. Then in similar modification we replace FFT by DCT, Discrete Cosine Transform.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
