Chebyshev and Fourier Spectral Methods Second Edition

نویسنده

  • John P. Boyd
چکیده

A computation is a temptation that should be resisted as long as possible. "

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A spectral method based on the second kind Chebyshev polynomials for solving a class of fractional optimal control problems

In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...

متن کامل

Velocity continuation by spectral methods

I apply Fourier and Chebyshev spectral methods to derive accurate and efficient algorithms for velocity continuation. As expected, the accuracy of the spectral methods is noticeably superior to that of the finite-difference approach. Both methods apply a transformation of the time axis to squared time. The Chebyshev method is slightly less efficient than the Fourier method, but has less problem...

متن کامل

Chebyshev Spectral Collocation Method for Computing Numerical Solution of Telegraph Equation

In this paper, the Chebyshev spectral collocation method(CSCM) for one-dimensional linear hyperbolic telegraph equation is presented. Chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. Firstly, we transform ...

متن کامل

A Fast Algorithm for Chebyshev, Fourier & Sinc Interpolation Onto an Irregular Grid

A Chebyshev or Fourier series may be evaluated on the standard collocation grid by the Fast Fourier Transform (FFT). Unfortunately, the FFT does not apply when one needs to sum a spectral series at N points which are spaced irregularly. The cost becomes O(N2) operations instead of the FFT's O(N log N). This sort of "off-grid" interpolation is needed by codes which dynamically readjust the grid ...

متن کامل

On Group Fourier Analysis and Symmetry Preserving Discretizations of PDEs

In this paper we review some group theoretic techniques applied to discretizations of PDEs. Inspired by the recent years active research in Lie groupand exponential time integrators for differential equations, we will in the first part of the article present algorithms for computing matrix exponentials based on Fourier transforms on finite groups. As an example, we consider spherically symmetri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000