Spectral method - Alchetron, The Free Social Encyclopedia

Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain differential equations, often involving the use of the Fast Fourier Transform. The idea is to write the solution of the differential equation as a sum of certain "basis functions" (for example, as a Fourier series which is a sum of sinusoids) and then to choose the coefficients in the sum in order to satisfy the differential equation as well as possible.

Spectral methods and finite element methods are closely related and built on the same ideas; the main difference between them is that spectral methods use basis functions that are nonzero over the whole domain, while finite element methods use basis functions that are nonzero only on small subdomains. In other words, spectral methods take on a global approach while finite element methods use a local approach. Partially for this reason, spectral methods have excellent error properties, with the so-called "exponential convergence" being the fastest possible, when the solution is smooth. However, there are no known three-dimensional single domain spectral shock capturing results (shock waves are not smooth). In the finite element community, a method where the degree of the elements is very high or increases as the grid parameter h decreases to zero is sometimes called a spectral element method.

Spectral methods can be used to solve ordinary differential equations (ODEs), partial differential equations (PDEs) and eigenvalue problems involving differential equations. When applying spectral methods to time-dependent PDEs, the solution is typically written as a sum of basis functions with time-dependent coefficients; substituting this in the PDE yields a system of ODEs in the coefficients which can be solved using any numerical method for ODEs. Eigenvalue problems for ODEs are similarly converted to matrix eigenvalue problems.

Spectral methods were developed in a long series of papers by Steven Orszag starting in 1969 including, but not limited to, Fourier series methods for periodic geometry problems, polynomial spectral methods for finite and unbounded geometry problems, pseudospectral methods for highly nonlinear problems, and spectral iteration methods for fast solution of steady state problems. The implementation of the spectral method is normally accomplished either with collocation or a Galerkin or a Tau approach.

Spectral methods are computationally less expensive than finite element methods, but become less accurate for problems with complex geometries and discontinuous coefficients. This increase in error is a consequence of the Gibbs phenomenon.

A concrete, linear example

Here we presume an understanding of basic multivariate calculus and Fourier series. If g(x,y) is a known, complex-valued function of two real variables, and g is periodic in x and y (that is, g(x,y)=g(x+2π,y)=g(x,y+2π)) then we are interested in finding a function f(x,y) so that

( ∂ 2 ∂ x 2 + ∂ 2 ∂ y 2 ) f ( x , y ) = g ( x , y ) for all x , y

where the expression on the left denotes the second partial derivatives of f in x and y, respectively. This is the Poisson equation, and can be physically interpreted as some sort of heat conduction problem, or a problem in potential theory, among other possibilities.

If we write f and g in Fourier series:

f =: ∑ a j , k e i ( j x + k y ) g =: ∑ b j , k e i ( j x + k y )

and substitute into the differential equation, we obtain this equation:

∑ − a j , k ( j 2 + k 2 ) e i ( j x + k y ) = ∑ b j , k e i ( j x + k y )

We have exchanged partial differentiation with an infinite sum, which is legitimate if we assume for instance that f has a continuous second derivative. By the uniqueness theorem for Fourier expansions, we must then equate the Fourier coefficients term by term, giving

(*) a j , k = − b j , k j 2 + k 2

which is an explicit formula for the Fourier coefficients a_j,k.

With periodic boundary conditions, the Poisson equation possesses a solution only if b_0,0 = 0. Therefore, we can freely choose a_0,0 which will be equal to the mean of the resolution. This corresponds to choosing the integration constant.

To turn this into an algorithm, only finitely many frequencies are solved for. This introduces an error which can be shown to be proportional to h n , where h := 1 / n and n is the highest frequency treated.

Algorithm

Compute the Fourier transform (b_j,k) of g.
Compute the Fourier transform (a_j,k) of f via the formula (*).
Compute f by taking an inverse Fourier transform of (a_j,k).

Since we're only interested in a finite window of frequencies (of size n, say) this can be done using a Fast Fourier Transform algorithm. Therefore, globally the algorithm runs in time O(n log n).

A concrete, nonlinear example

We wish to solve the forced, transient, nonlinear Burgers' equation using a spectral approach.

Given u ( x , 0 ) on the periodic domain x ∈ [ 0 , 2 π ) , find u ∈ U such that

∂ t u + u ∂ x u = ρ ∂ x x u + f ∀ x ∈ [ 0 , 2 π ) , ∀ t > 0

where ρ is the viscosity coefficient. In weak conservative form this becomes

⟨ ∂ t u , v ⟩ = ⟨ ∂ x ( − 1 2 u 2 + ρ ∂ x u ) , v ⟩ + ⟨ f , v ⟩ ∀ v ∈ V , ∀ t > 0

where ⟨ f , g ⟩ := ∫ 0 2 π f ( x ) g ( x ) ¯ d x following inner product notation. Integrating by parts and using periodicity grants

⟨ ∂ t u , v ⟩ = ⟨ 1 2 u 2 − ρ ∂ x u , ∂ x v ⟩ + ⟨ f , v ⟩ ∀ v ∈ V , ∀ t > 0.

To apply the Fourier-Galerkin method, choose both

U N := { u : u ( x , t ) = ∑ k = − N / 2 N / 2 − 1 u ^ k ( t ) e i k x }

and

V N := span { e i k x : k ∈ − N / 2 , … , N / 2 − 1 }

where u ^ k ( t ) := 1 2 π ⟨ u ( x , t ) , e i k x ⟩ . This reduces the problem to finding u ∈ U N such that

⟨ ∂ t u , e i k x ⟩ = ⟨ 1 2 u 2 − ρ ∂ x u , ∂ x e i k x ⟩ + ⟨ f , e i k x ⟩ ∀ k ∈ { − N / 2 , … , N / 2 − 1 } , ∀ t > 0.

Using the orthogonality relation ⟨ e i l x , e i k x ⟩ = 2 π δ l k where δ l k is the Kronecker delta, we simplify the above three terms for each k to see

⟨ ∂ t u , e i k x ⟩ = ⟨ ∂ t ∑ l u ^ l e i l x , e i k x ⟩ = ⟨ ∑ l ∂ t u ^ l e i l x , e i k x ⟩ = 2 π ∂ t u ^ k , ⟨ f , e i k x ⟩ = ⟨ ∑ l f ^ l e i l x , e i k x ⟩ = 2 π f ^ k , and ⟨ 1 2 u 2 − ρ ∂ x u , ∂ x e i k x ⟩ = ⟨ 1 2 ( ∑ p u ^ p e i p x ) ( ∑ q u ^ q e i q x ) − ρ ∂ x ∑ l u ^ l e i l x , ∂ x e i k x ⟩ = ⟨ 1 2 ∑ p ∑ q u ^ p u ^ q e i ( p + q ) x , i k e i k x ⟩ − ⟨ ρ i ∑ l l u ^ l e i l x , i k e i k x ⟩ = − i k 2 ⟨ ∑ p ∑ q u ^ p u ^ q e i ( p + q ) x , e i k x ⟩ − ρ k ⟨ ∑ l l u ^ l e i l x , e i k x ⟩ = − i π k ∑ p + q = k u ^ p u ^ q − 2 π ρ k 2 u ^ k .

Assemble the three terms for each k to obtain

2 π ∂ t u ^ k = − i π k ∑ p + q = k u ^ p u ^ q − 2 π ρ k 2 u ^ k + 2 π f ^ k k ∈ { − N / 2 , … , N / 2 − 1 } , ∀ t > 0.

Dividing through by 2 π , we finally arrive at

∂ t u ^ k = − i k 2 ∑ p + q = k u ^ p u ^ q − ρ k 2 u ^ k + f ^ k k ∈ { − N / 2 , … , N / 2 − 1 } , ∀ t > 0.

With Fourier transformed initial conditions u ^ k ( 0 ) and forcing f ^ k ( t ) , this coupled system of ordinary differential equations may be integrated in time (using, e.g., a Runge Kutta technique) to find a solution. The nonlinear term is a convolution, and there are several transform-based techniques for evaluating it efficiently. See the references by Boyd and Canuto et al. for more details.

A relationship with the spectral element method

One can show that if g is infinitely differentiable, then the numerical algorithm using Fast Fourier Transforms will converge faster than any polynomial in the grid size h. That is, for any n>0, there is a C < ∞ such that the error is less than C h n for all sufficiently small values of h . We say that the spectral method is of order n , for every n>0.

Because a spectral element method is a finite element method of very high order, there is a similarity in the convergence properties. However, whereas the spectral method is based on the eigendecomposition of the particular boundary value problem, the spectral element method does not use that information and works for arbitrary elliptic boundary value problems.

References

Spectral method Wikipedia

(Text) CC BY-SA

Contents

A concrete, linear example

Algorithm

A concrete, nonlinear example

A relationship with the spectral element method

References