2015
DOI: 10.1080/00207160.2015.1016923
|View full text |Cite
|
Sign up to set email alerts
|

WEB-Spline-based mesh-free finite element approximation forp-Laplacian

Abstract: In this paper, we discuss the approximation of p-Laplace problem using WEB-Spline based mesh free finite elements. Along with usual weak formulation, we also consider the mixed formulation of the pLaplace problem. We give existence, uniqueness results for both continuous and discrete problems. We also provide a priori error estimates for both the formulations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…In this section, four numerical examples are solved to demonstrate the efficiency and accuracy of the present SMRPI method. These examples were solved by other methods such as EFG method [16], IEFG method [17], FVM [14], the DG method [8] and the MFEM [7,23]. Since the best results of these methods are obtained using the EFG method, the comparison in this paper has been done between our results with those obtained in [16] and we omit any other attempts.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…In this section, four numerical examples are solved to demonstrate the efficiency and accuracy of the present SMRPI method. These examples were solved by other methods such as EFG method [16], IEFG method [17], FVM [14], the DG method [8] and the MFEM [7,23]. Since the best results of these methods are obtained using the EFG method, the comparison in this paper has been done between our results with those obtained in [16] and we omit any other attempts.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…. , n, being the distance between nodes in the support domain, R k,i = R i (r k ) are the RBFs in (7). We added the following m equations in (5) to make a square matrix:…”
Section: Smrpi Schemementioning
confidence: 99%
See 1 more Smart Citation
“…In the last decades, much effort has been made for the numerical solution of the (1.1). In particular, for p-Laplacian equation with κ(x) = 1, Some degrees of effectiveness can be achieved by mesh based methods such as finite element method (FEM) [2,3,25], finite difference method (FDM) [31], discontinuous Galerkin method [12], and meshless methods [8,29] etc.. In addition to those discretization methods, iterative methods such as preconditioned steepest descent, quasi-Newton or Newton method are employed to deal with the nonlinearity.…”
Section: Introductionmentioning
confidence: 99%