Math 2.0

Numerical analysis Definition

Spectral method

Builds on Fourier seriesChebyshev polynomialsLegendre polynomialsGalerkin method

Definition

Let LL be a linear differential operator on an interval or a box Ω\Omega, and consider Lu=fL u = f with boundary or periodicity conditions. Fix a family of smooth functions φk\varphi_k on all of Ω\Omega, each nonzero on most of Ω\Omega. Typical choices are eikxe^{ikx} for periodic problems, Chebyshev polynomials or Legendre polynomials otherwise. Let INI_N be a finite set of nn indices. A spectral method seeks uN=∑k∈INakφku_N = \sum_{k \in I_N} a_k \varphi_k and fixes the aka_k by one of three conditions:

  1. Galerkin: ⟨LuN−f,φj⟩=0\ip{L u_N - f}{\varphi_j} = 0 for all j∈INj \in I_N, with the φk\varphi_k satisfying the boundary conditions;
  2. tau: the same equations for all but mm indices jj, plus the mm boundary conditions written as equations on the aka_k;
  3. collocation: LuN(xj)=f(xj)L u_N(x_j) = f(x_j) at chosen points xjx_j, together with the boundary conditions, with nn equations in all.

Here ⟨⋅,⋅⟩\ip{\cdot}{\cdot} is the L2L^2 inner product, with the weight of the chosen polynomial family.

Remarks

Example: on [0,2π][0, 2\pi] with periodic conditions, solve −u′′+u=f-u'' + u = f with the Fourier basis eikxe^{ikx}, ∣k∣≤N\abs{k} \le N. The Galerkin condition gives (k2+1)ak=f^k(k^2 + 1) a_k = \hat f_k, where f^k\hat f_k are the Fourier coefficients of ff. So uNu_N is the truncation of the exact Fourier series of uu. If ff is analytic, f^k\hat f_k decays like e−c∣k∣e^{-c \abs{k}}, and so does the error of uNu_N.

Non-example: the finite element method with hat functions uses basis functions that vanish outside two mesh cells. These are not global functions, so it is not a spectral method; its error for smooth uu decreases only like a fixed power of 1/N1/N.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Chebyshev polynomials object
  2. Fourier series concept
  3. Galerkin method concept
  4. Legendre polynomials concept
  5. Spectral method definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Spectral_method
About this page
TagQFJEFGR171
URIm2://QFJEFGR171
Kinddefinition
WritingW0 stub
MSC65N35, 65M70
DefinesSpectral method
UsesFourier series, Chebyshev polynomials, Legendre polynomials, Galerkin method

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.