快速計算法　   (89年度 上學期)

Fast algorithms have been an important subject for scientific computing. They can usually reduce computational complexity to an order of one or two hence make many large-scale scientific problems to be computable. In this course, I shall introduce the following algorithms (1) Fast Fourier transform (2) Fast Wavelet methods (3) Fast multipole methods (4) Multigrid methods and fast Poisson solver (5) Domain decomposition methods

(1) Douglas F. Elliot, Fast Transformations (2) Jinchao Xu, Multigrid and Domain decomposition (3) Greengard, papers (4) I. Daubechies, Ten Lectures on wavelets

Students are required to finish 4 projects. Code design by using C or Fortran is required.

上課時間更動為：每週五上午二、三、四節 地點：新數102