老公的爸爸称谓是什么| 乙肝有什么明显的症状| 手麻挂什么科| 乏了是什么意思| 结石长什么样子图片| 离线缓存是什么意思| 蜜饯是什么| 慢热型是什么意思| 带教是什么意思| 剖腹产后可以吃什么| plano是什么意思| 亵渎什么意思| hoegaarden是什么啤酒| 玉米淀粉可以用什么代替| 难免流产什么意思| 促甲状腺激素偏高有什么症状| 什么的雄鸡| gn是什么颜色| 市辖区什么意思| 狮子座和什么座最不配| 汗毛长的女人代表什么| 什么时候不容易怀孕| 菜板什么材质的好| 栀子花什么时候修剪| 血糖忽高忽低是什么原因| 为什么积食发烧很难退| 梅毒抗体阳性说明什么| 雪青色是什么颜色| 马甲线长什么样| 身上长扁平疣是什么原因| 1977年出生属什么生肖| 探病送什么花| 篇幅是什么意思| 头疼恶心是什么症状| 经血颜色淡是什么原因| 每天喝一杯豆浆有什么好处| 考妣是什么意思| 篇幅是什么意思| 井代表什么数字| 林彪为什么反革命| 锲而不舍下一句是什么| 过敏性鼻炎吃什么药好的快| 五个月宝宝吃什么辅食最好| 枸杞什么时候吃最好| 送女生什么生日礼物比较好| 为什么牛肝便宜没人吃| 吃什么可以生发| 庸人什么意思| 组胺过敏是什么意思| 沈字五行属什么| 尿酸降低是什么意思| 打白条是什么意思| 本科是什么| 为什么会放屁| 什么姓氏好听| 乳腺增生结节吃什么药| 中秋节是什么时候| 化妆水是干什么用的| 脸过敏发红痒擦什么药| 什么叫手足口病| 吉祥动物是什么生肖| 内页是什么意思| 脑膜炎是什么病严重吗| 猪利是什么| 容易长口腔溃疡是什么原因| 小孩个子矮小吃什么促进生长发育| 小孩晚上睡觉流口水是什么原因| 人类的祖先是什么生肖| 医调委是什么机构| 奥美拉唑主要治什么| 治疗狐臭最好的方法是什么| 尿酸高吃什么中药能降下来| 劈腿什么意思| 梦见花生是什么意思| 恐惧是什么意思| dhea是什么药| 2004年是什么生肖| 艾叶泡脚有什么好处| 孔雀男是什么意思| 矫正度数是什么意思| 社会科学院是干什么的| 来事吃什么水果好| 1893年属什么| 忌口是什么意思| 女人梦见烧纸什么预兆| 牙齿发酸是什么病征兆| 不想吃油腻的东西是什么原因| 粉尘螨过敏是什么意思| 内衣什么品牌最好| 激光脱毛对人体有没有什么危害| 砖茶是什么茶| 宫颈hsil是什么意思| 解解乏是什么意思| 青色是什么颜色| 腿发软无力是什么原因引起的| 顶嘴是什么意思| 小孩肠胃感冒吃什么药| 梨花是什么生肖| 口干什么原因| 拉屎拉出血是什么原因| 祛斑去医院挂什么科| 肚子左侧疼是什么原因| 头发容易断是什么原因| 随心而欲是什么意思| 嗓子疼吃什么药见效最快| 怀孕生化了是什么原因| 黛力新是什么药| 北极熊代表什么生肖| 顾名思义什么意思| 四季豆是什么| 乐极生悲是什么意思| 结婚下雨有什么说法| 消化不好吃什么药| 恭送是什么意思| 文牍是什么意思| 伤寒病有什么症状| 老丈人是什么意思| mm什么意思| 活字印刷术是什么时候发明的| 菠萝与凤梨有什么区别| 孙红雷的老婆叫什么名字| 司局级是什么级别| 99属什么生肖| 糖醇是什么意思| 枸杞和山楂泡水喝有什么功效| 哈衣是什么意思| 女孩的英文是什么| 趋利避害是什么意思| 猪血和鸭血有什么区别| 胃热吃什么食物好| 转氨酶偏高是什么意思| 224是什么星座| 鸡奸是什么意思| 殇字是什么意思| 突然嗜睡是什么原因造成的| 火麻是什么植物| 朋友妻不可欺是什么意思| 肌肉纤维化是什么意思| 十月初一是什么节| 女性尿检能查出什么病| 副教授是什么级别| 丹毒不能吃什么| 什么水果降血压| 李子什么人不能吃| 2023年属兔的是什么命| 副县长是什么级别| 办什么厂比较好| 走资派是什么意思| 夏枯草治什么病| 肾虚对男生意味着什么| 为什么长斑| 羽下面隹什么字| 长期口腔溃疡挂什么科| 沙茶酱做什么菜最好吃| 432是什么意思| 透明的什么| 1月8日是什么星座| 眼睛红肿是什么原因引起的| 什么什么的沙滩| 来月经喝酒有什么影响| 鳗鱼吃什么食物| 龙是什么意思| 什么叫代孕| 山竹什么味道| 耳朵堵塞感是什么原因| 皮肤感染吃什么消炎药| tin什么意思| 看走眼是什么意思| nsfw是什么意思| 专属是什么意思| 什么是增强ct| 户籍信息是什么| 变异性哮喘咳嗽吃什么药| 芒果不能和什么水果一起吃| b超什么时候做| 铊是什么东西| 夹不住尿是什么原因| 火鸡面为什么这么贵| 内分泌失调吃什么食物好| 农历六月十四是什么星座| 虎视眈眈是什么意思| sry什么意思| 粉底液是干什么用的| 乙肝阻断针什么时候打| 夏天吃西瓜有什么好处| 漂洋过海是什么生肖| 照身份证穿什么颜色的衣服| 胃痛挂什么科| 胃气上逆是什么原因造成的| 减肥最快的方法是什么| abr是什么检查| 吃什么能消除脂肪瘤| 独善其身是什么意思啊| 胃反酸是什么原因造成的| 艾滋病检查什么项目| 胸一大一小什么原因| 什么样的阳光填形容词| 巨蟹座有什么特点| 什么桌椅| 早餐吃什么最有营养| 低压低是什么原因| 乳酸杆菌是什么| 大便臭是什么原因| 腹主动脉壁钙化是什么意思| 载脂蛋白a1偏高是什么原因| 蜂胶是什么| 放屁多是什么原因引起的| 消化不良吃什么食物| 翻车了是什么意思| 海洋里面有什么动物| 肠胃看病挂什么科| 吃什么最补脑| 什么是龙抬头| 脚底发烫是什么原因| rem睡眠是什么意思| 后援团是什么意思| 八月2号是什么星座| 铁路12306什么时候放票| 发膜是什么| 怀才不遇是什么意思| 什么是淋巴结| 黑松露什么味道| 副乳挂什么科| 牙周炎有什么症状| 一什么烟| 月经期间吃什么好| fsh是什么意思| gg是什么品牌| 什么人容易长智齿| 给产妇送什么礼物好| 意什么风发| 什么是痰湿| 宝宝湿疹用什么药膏| 电脑一体机什么牌子好| 肚子胀恶心想吐是什么原因| 肌肉拉伤是什么感觉| 掉头发是身体缺少什么| 养牛仔裤是什么意思| 前面有个豹子是什么车| 旅长是什么级别| 心烦意乱焦躁不安吃什么药| 鼻涕带血是什么原因引起的| 心肾不交失眠吃什么中成药| 头疼检查什么项目| 女人梦到小蛇什么预兆| penis是什么意思| 脚气用什么洗脚| 戒烟后为什么会发胖| 什么是环切手术| 生命的本质是什么| 孜孜不倦什么意思| 上眼皮肿了是什么原因| 国粹是什么| 胆汁反流吃什么药| 视力s和c代表什么| 阿扎西是什么意思| 医学影像技术是什么| 吃哈密瓜有什么好处| 樟脑是什么| 学海无涯苦作舟的上一句是什么| 梦见蚯蚓是什么预兆| 机能鞋是什么意思| 三人死亡属于什么事故| 北京立冬吃什么| 百度Jump to content

2018年正式上市 外媒首试大众小型SUV--T-Roc

From Wikipedia, the free encyclopedia
百度   其实,一审法院在判决中也认为,杨某的行为与段某某的死亡之间并无必然的因果关系,但是根据公平原则,判决杨某补偿死者亲属1万5千元。

Bass guitar time signal of open string A note (55 Hz).
Fourier transform of bass guitar time signal of open string A note (55 Hz). Fourier analysis reveals the oscillatory components of signals and functions.

In mathematics, Fourier analysis (/?f?rie?, -i?r/)[1] is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer.

The subject of Fourier analysis encompasses a vast spectrum of mathematics. In the sciences and engineering, the process of decomposing a function into oscillatory components is often called Fourier analysis, while the operation of rebuilding the function from these pieces is known as Fourier synthesis. For example, determining what component frequencies are present in a musical note would involve computing the Fourier transform of a sampled musical note. One could then re-synthesize the same sound by including the frequency components as revealed in the Fourier analysis. In mathematics, the term Fourier analysis often refers to the study of both operations.

The decomposition process itself is called a Fourier transformation. Its output, the Fourier transform, is often given a more specific name, which depends on the domain and other properties of the function being transformed. Moreover, the original concept of Fourier analysis has been extended over time to apply to more and more abstract and general situations, and the general field is often known as harmonic analysis. Each transform used for analysis (see list of Fourier-related transforms) has a corresponding inverse transform that can be used for synthesis.

To use Fourier analysis, data must be equally spaced. Different approaches have been developed for analyzing unequally spaced data, notably the least-squares spectral analysis (LSSA) methods that use a least squares fit of sinusoids to data samples, similar to Fourier analysis.[2][3] Fourier analysis, the most used spectral method in science, generally boosts long-periodic noise in long gapped records; LSSA mitigates such problems.[4]

Applications

[edit]

Fourier analysis has many scientific applications – in physics, partial differential equations, number theory, combinatorics, signal processing, digital image processing, probability theory, statistics, forensics, option pricing, cryptography, numerical analysis, acoustics, oceanography, sonar, optics, diffraction, geometry, protein structure analysis, and other areas.

This wide applicability stems from many useful properties of the transforms:

In forensics, laboratory infrared spectrophotometers use Fourier transform analysis for measuring the wavelengths of light at which a material will absorb in the infrared spectrum. The FT method is used to decode the measured signals and record the wavelength data. And by using a computer, these Fourier calculations are rapidly carried out, so that in a matter of seconds, a computer-operated FT-IR instrument can produce an infrared absorption pattern comparable to that of a prism instrument.[9]

Fourier transformation is also useful as a compact representation of a signal. For example, JPEG compression uses a variant of the Fourier transformation (discrete cosine transform) of small square pieces of a digital image. The Fourier components of each square are rounded to lower arithmetic precision, and weak components are eliminated, so that the remaining components can be stored very compactly. In image reconstruction, each image square is reassembled from the preserved approximate Fourier-transformed components, which are then inverse-transformed to produce an approximation of the original image.

In signal processing, the Fourier transform often takes a time series or a function of continuous time, and maps it into a frequency spectrum. That is, it takes a function from the time domain into the frequency domain; it is a decomposition of a function into sinusoids of different frequencies; in the case of a Fourier series or discrete Fourier transform, the sinusoids are harmonics of the fundamental frequency of the function being analyzed.

When a function is a function of time and represents a physical signal, the transform has a standard interpretation as the frequency spectrum of the signal. The magnitude of the resulting complex-valued function at frequency represents the amplitude of a frequency component whose initial phase is given by the angle of (polar coordinates).

Fourier transforms are not limited to functions of time, and temporal frequencies. They can equally be applied to analyze spatial frequencies, and indeed for nearly any function domain. This justifies their use in such diverse branches as image processing, heat conduction, and automatic control.

When processing signals, such as audio, radio waves, light waves, seismic waves, and even images, Fourier analysis can isolate narrowband components of a compound waveform, concentrating them for easier detection or removal. A large family of signal processing techniques consist of Fourier-transforming a signal, manipulating the Fourier-transformed data in a simple way, and reversing the transformation.[10]

Some examples include:

Variants of Fourier analysis

[edit]
A Fourier transform and 3 variations caused by periodic sampling (at interval ) and/or periodic summation (at interval ) of the underlying time-domain function. The relative computational ease of the DFT sequence and the insight it gives into make it a popular analysis tool.

(Continuous) Fourier transform

[edit]

Most often, the unqualified term Fourier transform refers to the transform of functions of a continuous real argument, and it produces a continuous function of frequency, known as a frequency distribution. One function is transformed into another, and the operation is reversible. When the domain of the input (initial) function is time (), and the domain of the output (final) function is ordinary frequency, the transform of function at frequency is given by the complex number:

Evaluating this quantity for all values of produces the frequency-domain function. Then can be represented as a recombination of complex exponentials of all possible frequencies:

which is the inverse transform formula. The complex number, conveys both amplitude and phase of frequency

See Fourier transform for much more information, including:

  • conventions for amplitude normalization and frequency scaling/units
  • transform properties
  • tabulated transforms of specific functions
  • an extension/generalization for functions of multiple dimensions, such as images.

Fourier series

[edit]

The Fourier transform of a periodic function, with period becomes a Dirac comb function, modulated by a sequence of complex coefficients:

    (where is the integral over any interval of length ).

The inverse transform, known as Fourier series, is a representation of in terms of a summation of a potentially infinite number of harmonically related sinusoids or complex exponential functions, each with an amplitude and phase specified by one of the coefficients:

Any can be expressed as a periodic summation of another function, :

and the coefficients are proportional to samples of at discrete intervals of :

[A]

Note that any whose transform has the same discrete sample values can be used in the periodic summation. A sufficient condition for recovering (and therefore ) from just these samples (i.e. from the Fourier series) is that the non-zero portion of be confined to a known interval of duration which is the frequency domain dual of the Nyquist–Shannon sampling theorem.

See Fourier series for more information, including the historical development.

Discrete-time Fourier transform (DTFT)

[edit]

The DTFT is the mathematical dual of the time-domain Fourier series. Thus, a convergent periodic summation in the frequency domain can be represented by a Fourier series, whose coefficients are samples of a related continuous time function:

which is known as the DTFT. Thus the DTFT of the sequence is also the Fourier transform of the modulated Dirac comb function.[B]

The Fourier series coefficients (and inverse transform), are defined by:

Parameter corresponds to the sampling interval, and this Fourier series can now be recognized as a form of the Poisson summation formula.  Thus we have the important result that when a discrete data sequence, is proportional to samples of an underlying continuous function, one can observe a periodic summation of the continuous Fourier transform, Note that any with the same discrete sample values produces the same DTFT.  But under certain idealized conditions one can theoretically recover and exactly. A sufficient condition for perfect recovery is that the non-zero portion of be confined to a known frequency interval of width   When that interval is the applicable reconstruction formula is the Whittaker–Shannon interpolation formula. This is a cornerstone in the foundation of digital signal processing.

Another reason to be interested in is that it often provides insight into the amount of aliasing caused by the sampling process.

Applications of the DTFT are not limited to sampled functions. See Discrete-time Fourier transform for more information on this and other topics, including:

  • normalized frequency units
  • windowing (finite-length sequences)
  • transform properties
  • tabulated transforms of specific functions

Discrete Fourier transform (DFT)

[edit]

Similar to a Fourier series, the DTFT of a periodic sequence, with period , becomes a Dirac comb function, modulated by a sequence of complex coefficients (see DTFT § Periodic data):

    (where is the sum over any sequence of length )

The sequence is customarily known as the DFT of one cycle of It is also -periodic, so it is never necessary to compute more than coefficients. The inverse transform, also known as a discrete Fourier series, is given by:

  where is the sum over any sequence of length

When is expressed as a periodic summation of another function:

  and  

the coefficients are samples of at discrete intervals of :

Conversely, when one wants to compute an arbitrary number of discrete samples of one cycle of a continuous DTFT, it can be done by computing the relatively simple DFT of as defined above. In most cases, is chosen equal to the length of the non-zero portion of Increasing known as zero-padding or interpolation, results in more closely spaced samples of one cycle of Decreasing causes overlap (adding) in the time-domain (analogous to aliasing), which corresponds to decimation in the frequency domain. (see Discrete-time Fourier transform § L=N×I) In most cases of practical interest, the sequence represents a longer sequence that was truncated by the application of a finite-length window function or FIR filter array.

The DFT can be computed using a fast Fourier transform (FFT) algorithm, which makes it a practical and important transformation on computers.

See Discrete Fourier transform for much more information, including:

  • transform properties
  • applications
  • tabulated transforms of specific functions

Summary

[edit]

For periodic functions, both the Fourier transform and the DTFT comprise only a discrete set of frequency components (Fourier series), and the transforms diverge at those frequencies. One common practice (not discussed above) is to handle that divergence via Dirac delta and Dirac comb functions. But the same spectral information can be discerned from just one cycle of the periodic function, since all the other cycles are identical. Similarly, finite-duration functions can be represented as a Fourier series, with no actual loss of information except that the periodicity of the inverse transform is a mere artifact.

It is common in practice for the duration of s(?) to be limited to the period, P or N.  But these formulas do not require that condition.

transforms (continuous-time)
Continuous frequency Discrete frequencies
Transform
Inverse
transforms (discrete-time)
Continuous frequency Discrete frequencies
Transform

Inverse

Symmetry properties

[edit]

When the real and imaginary parts of a complex function are decomposed into their even and odd parts, there are four components, denoted below by the subscripts RE, RO, IE, and IO. And there is a one-to-one mapping between the four components of a complex time function and the four components of its complex frequency transform:[11]

From this, various relationships are apparent, for example:

  • The transform of a real-valued function is the conjugate symmetric function Conversely, a conjugate symmetric transform implies a real-valued time-domain.
  • The transform of an imaginary-valued function is the conjugate antisymmetric function and the converse is true.
  • The transform of a conjugate symmetric function is the real-valued function and the converse is true.
  • The transform of a conjugate antisymmetric function is the imaginary-valued function and the converse is true.

History

[edit]

An early form of harmonic series dates back to ancient Babylonian mathematics, where they were used to compute ephemerides (tables of astronomical positions).[12][13][14][15]

The Classical Greek concepts of deferent and epicycle in the Ptolemaic system of astronomy were related to Fourier series (see Deferent and epicycle § Mathematical formalism).

In modern times, variants of the discrete Fourier transform were used by Alexis Clairaut in 1754 to compute an orbit,[16] which has been described as the first formula for the DFT,[17] and in 1759 by Joseph Louis Lagrange, in computing the coefficients of a trigonometric series for a vibrating string.[17] Technically, Clairaut's work was a cosine-only series (a form of discrete cosine transform), while Lagrange's work was a sine-only series (a form of discrete sine transform); a true cosine+sine DFT was used by Gauss in 1805 for trigonometric interpolation of asteroid orbits.[18] Euler and Lagrange both discretized the vibrating string problem, using what would today be called samples.[17]

An early modern development toward Fourier analysis was the 1770 paper Réflexions sur la résolution algébrique des équations by Lagrange, which in the method of Lagrange resolvents used a complex Fourier decomposition to study the solution of a cubic:[19] Lagrange transformed the roots into the resolvents:

where ζ is a cubic root of unity, which is the DFT of order 3.

A number of authors, notably Jean le Rond d'Alembert, and Carl Friedrich Gauss used trigonometric series to study the heat equation,[20] but the breakthrough development was the 1807 paper Mémoire sur la propagation de la chaleur dans les corps solides by Joseph Fourier, whose crucial insight was to model all functions by trigonometric series, introducing the Fourier series. Independently of Fourier, astronomer Friedrich Wilhelm Bessel also introduced Fourier series to solve Kepler's equation. His work was published in 1819, unaware of Fourier's work which remained unpublished until 1822.[21]

Historians are divided as to how much to credit Lagrange and others for the development of Fourier theory: Daniel Bernoulli and Leonhard Euler had introduced trigonometric representations of functions, and Lagrange had given the Fourier series solution to the wave equation, so Fourier's contribution was mainly the bold claim that an arbitrary function could be represented by a Fourier series.[17]

The subsequent development of the field is known as harmonic analysis, and is also an early instance of representation theory.

The first fast Fourier transform (FFT) algorithm for the DFT was discovered around 1805 by Carl Friedrich Gauss when interpolating measurements of the orbit of the asteroids Juno and Pallas, although that particular FFT algorithm is more often attributed to its modern rediscoverers Cooley and Tukey.[18][16]


Time–frequency transforms

[edit]

In signal processing terms, a function (of time) is a representation of a signal with perfect time resolution, but no frequency information, while the Fourier transform has perfect frequency resolution, but no time information.

As alternatives to the Fourier transform, in time–frequency analysis, one uses time–frequency transforms to represent signals in a form that has some time information and some frequency information – by the uncertainty principle, there is a trade-off between these. These can be generalizations of the Fourier transform, such as the short-time Fourier transform, the Gabor transform or fractional Fourier transform (FRFT), or can use different functions to represent signals, as in wavelet transforms and chirplet transforms, with the wavelet analog of the (continuous) Fourier transform being the continuous wavelet transform.

Fourier transforms on arbitrary locally compact abelian topological groups

[edit]

The Fourier variants can also be generalized to Fourier transforms on arbitrary locally compact Abelian topological groups, which are studied in harmonic analysis; there, the Fourier transform takes functions on a group to functions on the dual group. This treatment also allows a general formulation of the convolution theorem, which relates Fourier transforms and convolutions. See also the Pontryagin duality for the generalized underpinnings of the Fourier transform.

More specific, Fourier analysis can be done on cosets,[22] even discrete cosets.

See also

[edit]

Notes

[edit]
  1. ^
  2. ^ We may also note that:
    Consequently, a common practice is to model "sampling" as a multiplication by the Dirac comb function, which of course is only "possible" in a purely mathematical sense.

References

[edit]
  1. ^ "Fourier". Dictionary.com Unabridged (Online). n.d.
  2. ^ Cafer Ibanoglu (2000). Variable Stars As Essential Astrophysical Tools. Springer. ISBN 0-7923-6084-2.
  3. ^ D. Scott Birney; David Oesper; Guillermo Gonzalez (2006). Observational Astronomy. Cambridge University Press. ISBN 0-521-85370-2.
  4. ^ Press (2007). Numerical Recipes (3rd ed.). Cambridge University Press. ISBN 978-0-521-88068-8.
  5. ^ Rudin, Walter (1990). Fourier Analysis on Groups. Wiley-Interscience. ISBN 978-0-471-52364-2.
  6. ^ Evans, L. (1998). Partial Differential Equations. American Mathematical Society. ISBN 978-3-540-76124-2.
  7. ^ Knuth, Donald E. (1997). The Art of Computer Programming Volume 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley Professional. Section 4.3.3.C: Discrete Fourier transforms, pg.305. ISBN 978-0-201-89684-8.
  8. ^ Conte, S. D.; de Boor, Carl (1980). Elementary Numerical Analysis (Third ed.). New York: McGraw Hill, Inc. ISBN 978-0-07-066228-5.
  9. ^ Saferstein, Richard (2013). Criminalistics: An Introduction to Forensic Science.
  10. ^ Rabiner, Lawrence R.; Gold, Bernard (1975). Theory and Application of Digital Signal Processing. Prentice-Hall. ISBN 9780139141010. OCLC 602011570.
  11. ^ Proakis, John G.; Manolakis, Dimitri G. (1996), Digital Signal Processing: Principles, Algorithms and Applications (3 ed.), New Jersey: Prentice-Hall International, p. 291, ISBN 978-0-13-394289-7, sAcfAQAAIAAJ
  12. ^ Prestini, Elena (2004). The Evolution of Applied Harmonic Analysis: Models of the Real World. Birkh?user. p. 62. ISBN 978-0-8176-4125-2.
  13. ^ Rota, Gian-Carlo; Palombi, Fabrizio (1997). Indiscrete Thoughts. Birkh?user. p. 11. ISBN 978-0-8176-3866-5.
  14. ^ Neugebauer, Otto (1969) [1957]. The Exact Sciences in Antiquity. Acta Historica Scientiarum Naturalium et Medicinalium. Vol. 9 (2nd ed.). Dover Publications. pp. 1–191. ISBN 978-0-486-22332-2. PMID 14884919.
  15. ^ Brack-Bernsen, Lis; Brack, Matthias (2004). "Analyzing shell structure from Babylonian and modern times". International Journal of Modern Physics E. 13 (1): 247. arXiv:physics/0310126. Bibcode:2004IJMPE..13..247B. doi:10.1142/S0218301304002028. S2CID 15704235.
  16. ^ a b Terras, Audrey (1999). Fourier Analysis on Finite Groups and Applications. Cambridge University Press. pp. 30-32. ISBN 978-0-521-45718-7.
  17. ^ a b c d Briggs, William L.; Henson, Van Emden (1995). The DFT: An Owner's Manual for the Discrete Fourier Transform. SIAM. pp. 2–4. ISBN 978-0-89871-342-8.
  18. ^ a b Heideman, M.T.; Johnson, D. H.; Burrus, C. S. (1984). "Gauss and the history of the fast Fourier transform". IEEE ASSP Magazine. 1 (4): 14–21. doi:10.1109/MASSP.1984.1162257. S2CID 10032502.
  19. ^ Knapp, Anthony W. (2006). Basic Algebra. Springer. p. 501. ISBN 978-0-8176-3248-9.
  20. ^ Narasimhan, T.N. (February 1999). "Fourier's heat conduction equation: History, influence, and connections". Reviews of Geophysics. 37 (1): 151–172. Bibcode:1999RvGeo..37..151N. CiteSeerX 10.1.1.455.4798. doi:10.1029/1998RG900006. ISSN 1944-9208. OCLC 5156426043. S2CID 38786145.
  21. ^ Dutka, Jacques (1995). "On the early history of Bessel functions". Archive for History of Exact Sciences. 49 (2): 105–134. doi:10.1007/BF00376544.
  22. ^ Forrest, Brian (1998). "Fourier Analysis on Coset Spaces". Rocky Mountain Journal of Mathematics. 28 (1): 170–190. doi:10.1216/rmjm/1181071828. JSTOR 44238164.

Further reading

[edit]
[edit]
男士长脸适合什么发型 酸西地那非片是什么药 什么旺水命 男羊配什么属相最好 钯金和铂金有什么区别
卟啉症是什么病 尿沉渣红细胞高是什么原因 省纪委常委是什么级别 赤小豆是什么 减肥吃什么药瘦得快
肠粘连是什么原因引起 尿液清澈透明说明什么 表姐的儿子叫我什么 溶菌酶是什么 ib是什么单位
跟腱炎挂什么科 脸上出汗是什么原因 台阶是什么意思 痛风什么东西不可以吃 甲功五项能查出什么病
罴是什么动物hcv9jop4ns2r.cn 拉缸是什么意思hcv9jop1ns7r.cn 解脲支原体阳性是什么病creativexi.com 天干指的是什么hcv8jop1ns6r.cn 什么是冬虫夏草hcv9jop2ns1r.cn
脸上长痘痘用什么药膏效果好wmyky.com 纯情什么意思cj623037.com 牙周炎用什么药hcv9jop0ns8r.cn 宝宝发烧是什么原因引起的hcv9jop2ns7r.cn 农历12月是什么月hcv7jop4ns7r.cn
什么人容易得间质瘤hcv9jop1ns9r.cn 吕布为什么要杀董卓hcv7jop9ns3r.cn 什么水不能喝hcv8jop4ns6r.cn 朱砂红是什么颜色hcv7jop7ns3r.cn 心理素质差是什么原因hcv8jop6ns6r.cn
减肥不能吃什么水果hcv8jop4ns9r.cn 乙肝大三阳是什么意思hcv9jop2ns8r.cn 高铁上不能带什么hcv9jop6ns0r.cn 窦房结内游走性心律是什么意思hcv9jop3ns8r.cn 流感吃什么药hcv8jop7ns9r.cn
百度