"고속 푸리에 변환"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
| 63번째 줄: | 63번째 줄: | ||
* http://ko.wikipedia.org/wiki/ | * http://ko.wikipedia.org/wiki/ | ||
| − | * http://en.wikipedia.org/wiki/Cooley- | + | * http://en.wikipedia.org/wiki/Cooley-Tukey_FFT_algorithm |
* [http://en.wikipedia.org/wiki/John_Tukey ]http://en.wikipedia.org/wiki/John_Tukey | * [http://en.wikipedia.org/wiki/John_Tukey ]http://en.wikipedia.org/wiki/John_Tukey | ||
* [http://en.wikipedia.org/wiki/James_Cooley ]http://en.wikipedia.org/wiki/James_Cooley | * [http://en.wikipedia.org/wiki/James_Cooley ]http://en.wikipedia.org/wiki/James_Cooley | ||
| 80번째 줄: | 80번째 줄: | ||
<h5>관련논문</h5> | <h5>관련논문</h5> | ||
| + | * D.N. Rockmore, “The FFT: an algorithm the whole family can use,” Computing in Science & Engineering 2, no. 1 (2000): 60-64. http://dx.doi.org/10.1109/5992.814659 | ||
| + | * J.W. Cooley, P.A.W. Lewis, and P.D. Welch, “Historical notes on the fast Fourier transform,” Proceedings of the IEEE 55, no. 10 (1967): 1675-1677. http://dx.doi.org/10.1109/PROC.1967.5959 | ||
* http://www.jstor.org/action/doBasicSearch?Query= | * http://www.jstor.org/action/doBasicSearch?Query= | ||
* http://www.ams.org/mathscinet | * http://www.ams.org/mathscinet | ||
2011년 1월 9일 (일) 10:22 판
이 항목의 스프링노트 원문주소
개요
재미있는 사실
- Math Overflow http://mathoverflow.net/search?q=
- 네이버 지식인 http://kin.search.naver.com/search.naver?where=kin_qna&query=
역사
- http://www.google.com/search?hl=en&tbs=tl:1&q=
- Earliest Known Uses of Some of the Words of Mathematics
- Earliest Uses of Various Mathematical Symbols
- 수학사연표
메모
관련된 항목들
수학용어번역
- 단어사전 http://www.google.com/dictionary?langpair=en%7Cko&q=
- 발음사전 http://www.forvo.com/search/
- 대한수학회 수학 학술 용어집
- 남·북한수학용어비교
- 대한수학회 수학용어한글화 게시판
사전 형태의 자료
- http://ko.wikipedia.org/wiki/
- http://en.wikipedia.org/wiki/Cooley-Tukey_FFT_algorithm
- [1]http://en.wikipedia.org/wiki/John_Tukey
- [2]http://en.wikipedia.org/wiki/James_Cooley
- http://en.wikipedia.org/wiki/Richard_L._Garwin
- http://en.wikipedia.org/wiki/
- http://www.proofwiki.org/wiki/
- http://www.wolframalpha.com/input/?i=
- The Online Encyclopaedia of Mathematics
- NIST Digital Library of Mathematical Functions
- The On-Line Encyclopedia of Integer Sequences
관련논문
- D.N. Rockmore, “The FFT: an algorithm the whole family can use,” Computing in Science & Engineering 2, no. 1 (2000): 60-64. http://dx.doi.org/10.1109/5992.814659
- J.W. Cooley, P.A.W. Lewis, and P.D. Welch, “Historical notes on the fast Fourier transform,” Proceedings of the IEEE 55, no. 10 (1967): 1675-1677. http://dx.doi.org/10.1109/PROC.1967.5959
- http://www.jstor.org/action/doBasicSearch?Query=
- http://www.ams.org/mathscinet
- http://dx.doi.org/10.1109/MCISE.2000.814652
관련도서
- 도서내검색
- 도서검색
관련기사
- 네이버 뉴스 검색 (키워드 수정)