Spectral methods on triangles and other domains
Journal of Scientific Computing
Monomial cubature rules since “Stroud”: a compilation
Journal of Computational and Applied Mathematics
Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere
ACM Transactions on Mathematical Software (TOMS)
From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
SIAM Journal on Numerical Analysis
Monomial cubature rules since “Stroud”: a compilation—part 2
Journal of Computational and Applied Mathematics - Numerical evaluation of integrals
Lagrange—Galerkin methods on spherical geodesic grids: the shallow water equations
Journal of Computational Physics
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)
Journal of Computational Physics
An Algorithm for Computing Fekete Points in the Triangle
SIAM Journal on Numerical Analysis
Nodal high-order discontinuous Galerkin methods for the spherical shallow water equations
Journal of Computational Physics
Unsteady analytical solutions of the spherical shallow water equations
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
Unsteady analytical solutions of the spherical shallow water equations
Journal of Computational Physics
A parallel adaptive barotropic model of the atmosphere
Journal of Computational Physics
A discontinuous Galerkin method for the shallow water equations in spherical triangular coordinates
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
Sparse tensor spherical harmonics approximation in radiative transfer
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
Hi-index | 31.50 |
A nodal triangle-based spectral element (SE) method for the shallow water equations on the sphere is presented. The original SE method uses quadrilateral elements and high-order nodal Lagrange polynomials, constructed from a tensor-product of the Legendre-Gauss-Lobatto points. In this work, we construct the high-order Lagrange polynomials directly on the triangle using nodal sets obtained from the electrostatics principle [J.S. Hesthaven, From electrostatics to almost optimal nodal sets for polynomial interpolation in a simplex, SIAM Journal on Numerical Analysis 35 (1998) 655-676] and Fekete points [M.A. Taylor, B.A. Wingate, R.E. Vincent, An algorithm for computing Fekete points in the triangle, SIAM Journal on Numerical Analysis 38 (2000) 1707-1720]. These points have good approximation properties and far better Lebesgue constants than any other nodal set derived for the triangle. By employing triangular elements as the basic building-blocks of the SE method and the Cartesian coordinate form of the equations, we can use any grid imaginable including adaptive unstructured grids. Results for six test cases are presented to confirm the accuracy and stability of the method. The results show that the triangle-based SE method yields the expected exponential convergence and that it can be more accurate than the quadrilateral-based SE method even while using 30-60% fewer grid points especially when adaptive grids are used to align the grid with the flow direction. However, at the moment, the quadrilateral-based SE method is twice as fast as the triangle-based SE method because the latter does not yield a diagonal mass matrix.