Exact computation in numerical linear algebra: The discrete fourier transform

被引：0
|
作者：
Anderson, JADW [1 ]
Sweby, PK [1 ]
机构：
[1] Univ Reading, Dept Comp Sci, Reading RG6 6AY, Berks, England
来源：
GODUNOV METHODS: THEORY AND APPLICATIONS | 2001年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
An encoding of the rational rotations is introduced which allows all rational affine transformations to be computed exactly. This encoding is used in combination with transrational numbers to give total trigonometric functions. It is shown how these functions can be used to compute indefinitely many digits of the Discrete Fourier Transform.
引用
收藏
页码：61 / 67
页数：5
相关论文
共 50 条
12345