Return to search

Fast algorithms for setting up the stiffness matrix in hp-FEM: a comparison

We analyze and compare different techniques to
set up the stiffness matrix in the hp-version
of the finite element method. The emphasis is
on methods for second order elliptic problems
posed on meshes including triangular and
tetrahedral elements. The polynomial degree
may be variable. We present a generalization
of the Spectral Galerkin Algorithm of [7],
where the shape functions are adapted to the
quadrature formula, to the case of
triangles/tetrahedra. Additionally, we study
on-the-fly matrix-vector multiplications, where
merely the matrix-vector multiplication is
realized without setting up the stiffness matrix.
Numerical studies are included.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200601623
Date11 September 2006
CreatorsEibner, Tino, Melenk, Jens Markus
ContributorsTU Chemnitz, SFB 393
PublisherUniversitätsbibliothek Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:preprint
Formattext/html, text/plain, image/png, image/gif, text/plain, image/gif, application/pdf, application/x-gzip, text/plain, application/zip
SourcePreprintreihe des Chemnitzer SFB 393, 05-08

Page generated in 0.0024 seconds