摘要
The fast Hartley transform (FHT) and fast W transform (FWT) algorithm for,solving welLconditioned r-circulant equations is presented in this paper. The arithmetic operation save about half compared with the fast Fourier transform (FFT) algorithm. For ill-condotioned cases, an efficient numerical stable methods for solving r-circulant equations is suggested by using FHT, FWT and truncated singualr value decomposition (TSVD) method. An open problem is solved.
The fast Hartley transform (FHT) and fast W transform (FWT) algorithm for,solving welLconditioned r-circulant equations is presented in this paper. The arithmetic operation save about half compared with the fast Fourier transform (FFT) algorithm. For ill-condotioned cases, an efficient numerical stable methods for solving r-circulant equations is suggested by using FHT, FWT and truncated singualr value decomposition (TSVD) method. An open problem is solved.
出处
《计算数学》
CSCD
北大核心
1998年第1期45-55,共11页
Mathematica Numerica Sinica
基金
国家自然科学基金!19601012
关键词
γ-循环方程组
线性代数方程组
W变换
快速算法
r-circulant equations, fast Fourier transform, fast Hartley transform, fast W transform, truncated singular value decomposition
