Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2018
DOI: 10.1016/j.cma.2018.01.027
|View full text |Cite
|
Sign up to set email alerts
|

Predictor–corrector p- and hp-versions of the finite element method for Poisson’s equation in polygonal domains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 25 publications
0
7
0
Order By: Relevance
“…In real computations of the coefficients cn$$ {c}_n $$ in the asymptotic expansion () using the expression (), for example, for the purpose of increasing the accuracy of numerical solutions of problem () (cf. Brenner 5 and Nkemzi and Tanekou 19 ), the infinite series () must be replaced with a truncated series of the form cnKfalse(tfalse)=12μnnormalΓfalse(μn+1false)k=1Kλn,kμnun,kfalse(tfalse),0.30emt>0.$$ {c}_n^K(t)=\frac{1}{2^{\mu_n}\Gamma \left({\mu}_n+1\right)}\sum \limits_{k=1}^K{\lambda}_{n,k}^{\mu_n}{u}_{n,k}(t),\kern0.30em t>0. $$ …”
Section: The Model Problem In a Circular Sectormentioning
confidence: 99%
“…In real computations of the coefficients cn$$ {c}_n $$ in the asymptotic expansion () using the expression (), for example, for the purpose of increasing the accuracy of numerical solutions of problem () (cf. Brenner 5 and Nkemzi and Tanekou 19 ), the infinite series () must be replaced with a truncated series of the form cnKfalse(tfalse)=12μnnormalΓfalse(μn+1false)k=1Kλn,kμnun,kfalse(tfalse),0.30emt>0.$$ {c}_n^K(t)=\frac{1}{2^{\mu_n}\Gamma \left({\mu}_n+1\right)}\sum \limits_{k=1}^K{\lambda}_{n,k}^{\mu_n}{u}_{n,k}(t),\kern0.30em t>0. $$ …”
Section: The Model Problem In a Circular Sectormentioning
confidence: 99%
“…Our algorithm makes use of the extraction formulas for the coefficients of the singularities, and it consists of starting with some initial values of the coefficients and then computing the coefficients and the regular part of the solution iteratively, hence the name "Predictor-corrector finite element method," refer [23] for the corresponding algorithm for Poisson's equation on polygonal domains. e present algorithm provides several advantages.…”
Section: Introductionmentioning
confidence: 99%
“…This method has been shown to be very efficient, especially in combination with the p-and hp-versions of the finite element method as in these cases the finite element solutions exhibit exponential convergence (cf. [26]).…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the coefficients can be approximated once an approximate solution of the boundary value problem is available (cf. [24, 26]). This method is similar to the dual singular function method.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation