Sparse spectral-Galerkin method on an arbitrary tetrahedron using generalized Koornwinder polynomials

From MaRDI portal
Publication:2113669

DOI10.1007/S10915-022-01778-YzbMATH Open1490.65277arXiv2105.07547OpenAlexW3161469926MaRDI QIDQ2113669FDOQ2113669

Huiyuan Li, Lueling Jia, Zhimin Zhang

Publication date: 14 March 2022

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Abstract: In this paper, we propose a sparse spectral-Galerkin approximation scheme for solving the second-order partial differential equations on an arbitrary tetrahedron. Generalized Koornwinder polynomials are introduced on the reference tetrahedron as basis functions with their various recurrence relations and differentiation properties being explored. The method leads to well-conditioned and sparse linear systems whose entries can either be calculated directly by the orthogonality of the generalized Koornwinder polynomials for differential equations with constant coefficients or be evaluated efficiently via our recurrence algorithm for problems with variable coefficients. Clenshaw algorithms for the evaluation of any polynomial in an expansion of the generalized Koornwinder basis are also designed to boost the efficiency of the method. Finally, numerical experiments are carried out to illustrate the effectiveness of the proposed Koornwinder spectral method.


Full work available at URL: https://arxiv.org/abs/2105.07547




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Sparse spectral-Galerkin method on an arbitrary tetrahedron using generalized Koornwinder polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113669)