Spectral element method

Spectral element method

In mathematics, the spectral element method is a high order finite element method.

Introduced in a 1984 paper [A. T. Patera. A spectral element method for fluid dynamics - Laminar flow in a channel expansion. "Journal of Computational Physics", 54:468--488, 1984.] by A. T. Patera, the abstract begins: "A spectral element method that combines the generality of the finite element method with the accuracy of spectral techniques..."

The spectral element method is an elegant formulation of the finite element method with a high degree piecewise polynomial basis. The only relationship it has with the spectral method is its good convergence properties.

Discussion

The spectral method expands the solution in trigonometric series, a chief advantage is that the resulting method is of very high order. This approach relies on the fact that trigonometric polynomials are an orthonormal basis for L^2(Omega). The spectral element method chooses instead high degree piecewise polynomial basis functions, also achieving a very high order of accuracy.

A-priori error estimate

The classic analysis of Galerkin methods and Céa's lemma holds here and it can be shown that, if "u" is the solution of the weak equation, "uN" is the approximate solution and u in H^{s+1}(Omega):

:|u-u_N|_{H^1(Omega)} leq C_s N^{-s} | u |_{H^{s+1}(Omega}

where "C" is independent from "N" and "s" is no larger than the degree of the piecewise polynomial basis. As we increase "N", we can also increase the degree of the basis functions. In this case, if "u" is an analytic function:

:|u-u_N|_{H^1(Omega)} leq C exp( - gamma N )

where gamma depends only on u.

Related methods

* G-NI or SEM-NI: these are the most used spectral methods. The Galerkin formulation of spectral methods or spectral element methods, for G-NI or SEM-NI respectively, is modified and Gaussian numerical integration is used instead of integrals in the definition of the bilinear form a(cdot,cdot) and in the functional F. These method are a family of Petrov-Galerkin methods their convergence is a consequence of Strang's lemma.
* The spectral element method uses tensor product space spanned by nodal basis functions associated with Gauss-Lobatto points. In contrast, the p-version finite element method spans a space of high order polynomials by nodeless basis functions, chosen approximately orthogonal for numerical stability. Since not all interior basis functions need to be present, the p-version finite element method can create a space that that contains all polynomials up to a given degree with many fewer degrees of freedom. However, some speedup techniques possible in spectral methods due to their tensor-product character are no longer available. The name "p-version" means that accuracy is increased by increasing the order of the approximating polynomials (thus, "p") rather than decreasing the mesh size, "h". The h-p finite element method increases the order and decreases the mesh size at the same time.

Notes


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Finite element method — The finite element method (FEM) (sometimes referred to as finite element analysis) is a numerical technique for finding approximate solutions of partial differential equations (PDE) as well as of integral equations. The solution approach is based …   Wikipedia

  • Spectral method — Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain Dynamical Systems, often involving the use of the Fast Fourier Transform. Where applicable, spectral methods have… …   Wikipedia

  • Method of lines — The method of lines (MOL, NMOL, NUMOL) (Schiesser, 1991; Hamdi, et al., 2007; Schiesser, 2009 ) is a technique for solving partial differential equations (PDEs) in which all but one dimension is discretized. MOL allows standard, general purpose… …   Wikipedia

  • Multigrid method — Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not… …   Wikipedia

  • Discontinuous Galerkin method — Discontinuous Galerkin methods (DG methods) in mathematics form a class of numerical methods for solving partial differential equations. They combine features of the finite element and the finite volume framework and have been successfully… …   Wikipedia

  • Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.[1] It is a second order method in time, implicit in time, and is numerically …   Wikipedia

  • Collocation method — In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations. The idea is to choose a finite dimensional space of candidate solutions… …   Wikipedia

  • Schwarz alternating method — In mathematics, the Schwarz alternating method, named after Hermann Schwarz, is an iterative method to find the solution of a partial differential equations on a domain which is the union of two overlapping subdomains, by solving the equation on… …   Wikipedia

  • Neumann–Dirichlet method — In mathematics, the Neumann–Dirichlet method is a domain decomposition preconditioner which involves solving Neumann boundary value problem on one subdomain and Dirichlet boundary value problem on another, adjacent across the interface between… …   Wikipedia

  • Variational method (quantum mechanics) — The variational method is, in quantum mechanics, one way of finding approximations to the lowest energy eigenstate or ground state, and some excited states. The basis for this method is the variational principle. Introduction Suppose we are given …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”