کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4626164 | 1631783 | 2015 | 13 صفحه PDF | دانلود رایگان |
Two types of univariate Petrov–Galerkin elements using piecewise polynomials are described by Chen and Xu (1998) and four lemmas are proved for convergence of k−0k−0 Petrov–Galerkin elements. For k−0k−0 Petrov–Galerkin elements, the choice of k has a restriction 1 ≤ k ≤ 5.In this paper, we want to prove that some regular pairs exist which violate those lemmas and we are interested in showing how the continuous or discontinuous Petrov–Galerkin Lagrange-type k−0k−0 elements can be generalized to eliminate that restriction. For this purpose, we improve old constructions with using Chebyshev polynomials first kind and second kind. We will call these new elements the generalized continuous Lagrange-type k−0k−0 elements and the generalized discontinuous Lagrange-type k−0k−0 elements.After that, new proofs are introduced for four lemmas in Chen and Xu (1998) by using the new constructions. The most important features of these improved regular pairs are the elimination of each restriction and having accuracy and efficiency of them in respect to common version. Finally, numerical results of some relevant counterexamples will demonstrate accuracy and efficiency of the suggested methods.
Journal: Applied Mathematics and Computation - Volume 271, 15 November 2015, Pages 352–364