Spectral Element Methods on Unstructured Meshes: Comparisons and Recent Advances

Authors:
Richard Pasquetti;Francesca Rapetti
Affiliations:
Laboratory J.-A. Dieudonné, UMR CNRS 6621 and University de Nice-Sophia Antipolis, Nice Cedex 02, France 06108;Laboratory J.-A. Dieudonné, UMR CNRS 6621 and University de Nice-Sophia Antipolis, Nice Cedex 02, France 06108
Venue:
Journal of Scientific Computing
Year:
2006

Citing 10
Cited 3

On certain configurations of points in Rn which are unisolvent for polynomial interpolation

Journal of Approximation Theory
Spectral methods on triangles and other domains

Journal of Scientific Computing
From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex

SIAM Journal on Numerical Analysis
A generalized diagonal mass matrix spectral element method for non-quadrilateral elements

Proceedings of the fourth international conference on Spectral and high order methods (ICOSAHOM 1998)
A pseudo-spectral scheme for the incompressible Navier-Stokes equations using unstructured nodal elements

Journal of Computational Physics
Stable Spectral Methods on Tetrahedral Elements

SIAM Journal on Scientific Computing
Tensor product Gauss-Lobatto points are Fekete points for the cube

Mathematics of Computation
An Algorithm for Computing Fekete Points in the Triangle

SIAM Journal on Numerical Analysis
Nodal high-order methods on unstructured grids

Journal of Computational Physics
Spectral element methods on triangles and quadrilaterals: comparisons and applications

Journal of Computational Physics

Computing approximate Fekete points by QR factorizations of Vandermonde matrices

Computers & Mathematics with Applications
Spectral element methods on unstructured meshes: which interpolation points?

Numerical Algorithms
A new triangular spectral element method I: implementation and analysis on a triangle

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spectral element approximations for triangles are not yet as mature as for quadrilaterals. Here we compare different algorithms and show that using an integration rule based on Gauss-points for simplices is of interest. We point out that this can be handled efficiently and allows to recover the convergence rate theoretically expected, even with curved elements.