机读格式显示(MARC)

• 000 01235nam2 2200301 4500

• 000 0000276184

• 001 0000224217

• 005 20111127194628.0

• 010 __ |a 978-7-302-24497-4 |d CNY39.00

• 100 __ |a 20111127d2011 em y0chiy50 ea

• 101 0_ |a chi

• 102 __ |a CN |b 110000

• 105 __ |a ak z 000yy

• 106 __ |a r

• 200 1_ |a 快速傅里叶变换的计算框架 |A Computational Frameworks for the Fast Fourier Transform |f （美）罗恩主编

• 210 __ |a 北京 |c 清华大学出版社 |d 2011

• 215 __ |a 273页 |c 图 |d 26cm

• 300 __ |a 国际著名数学图书--影印版

• 330 __ |a 《快速傅里叶变换的计算框架(影印版)》内容简介：The fast fourier transform (fft) family of algorithms has revolutionized many areas of scientific computation. the fft is one of the most widely used algorithms in science and engineering, with applications in almost every discipline. this volume is the most comprehensive treatment of ffts to date.

• 606 0_ |傅 里叶变换 |j 英文

• 690 __ |a O174.22 |v 4

• 701 _0 |a 罗恩 |A luo en |4 主编

• 801 _0 |a CN |b |c 20111127

• 905 __ |a DQNU |d O174.22/L94

• 909 __ |a 00972911 |b 平装 |f O174.22/L94 |x YBS |e 001 |j 01

• 991 __

• 995 __ |a DQNU |b 00972911 |f O174.22/L94 |s 1

• 999 __ |t C |A shsd2 |a 20111127 19:38:45 |M shsd2 |m 20111127 19:46:2