1) discrete sine transform
离散正弦变换
1.
The fast algorithms are proposed for the computation of the running discrete cosine transform- I (DCT-- I ), discrete sine transform- I (DST-I ), discrete cosine transform-Ⅲ (DCT- Ⅲ ), and discrete sine transform-Ⅲ(DST-Ⅲ ), which provide considerable computational savings.
提出了计算Ⅰ型和Ⅲ型滑动离散余弦变换和滑动离散正弦变换的快速 算法。
2) Discrete Cosine Transform (DST)
离散正弦变换(DST)
3) FDP Forward Discrete Cosine Transform
离散余弦正变换
4) discrete cosine(sine) transform
离散余弦(正弦)变换
5) Discrete cosine and sine transforms
离散余弦和正弦变换
6) pentadiagonal matrix
离散余弦变换/离散正弦变换
1.
This dissertation mainly studies the algorithm to find the inverse of a general pentadiagonal matrix and new splitting iteration methods for Toeplitz systems.
本文主要对基于符号代数系统(如Maple、Matlab等)的五对角矩阵求逆算法和基于离散余弦变换/离散正弦变换的求解Toeplitz系统的新分裂方法进行了系统的研究。
补充资料：Fourier正弦变换
Fourier正弦变换
Fourier sine transform
见F血的er变换(Fot川ertl刁川form).F仪‘er正弦变换[F.‘政‘理七田画晌n;e。。yc一np岭o6pa-30“a，e巾yp‘l
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条