2020
DOI: 10.1016/j.amc.2020.125326
|View full text |Cite
|
Sign up to set email alerts
|

Error analysis of the meshless finite point method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 27 publications
0
15
0
Order By: Relevance
“…• The error estimate in Equation It should be mentioned that the condition number of matrices K and N depends on h. So as h → 0, the term cond(KN −1 ) could increase in such a way that the cond(KN −1 )h m − l + 1 goes to infinity. However, this problem solved very recently when Li and Dong [14] proposed the discrete error estimate of the finite point method which is independent of the condition number of the coefficient matrix.…”
Section: Comparing Error Estimate (38) With Existing Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…• The error estimate in Equation It should be mentioned that the condition number of matrices K and N depends on h. So as h → 0, the term cond(KN −1 ) could increase in such a way that the cond(KN −1 )h m − l + 1 goes to infinity. However, this problem solved very recently when Li and Dong [14] proposed the discrete error estimate of the finite point method which is independent of the condition number of the coefficient matrix.…”
Section: Comparing Error Estimate (38) With Existing Resultsmentioning
confidence: 99%
“…The finite point method (FPM) is a specific meshless scheme in which the MLS approximation is combined with the collocation approach to solve the strong form of the PDE (PIDE) under consideration. This method has been applied successfully to approximate solutions of time‐independent [13, 14] and also time‐dependent PDEs [9]. The method is also applied to the numerical solution of mathematical models arising from engineering [15, 16] and also valuation of American options under the Black–Sholes model [17, 18].…”
Section: Introductionmentioning
confidence: 99%
“…Since the CVMLS shape function Φ j (x) lacks the delta function property [18,20] , i.e., Φ j (x I ) = δ jI , we have u I = u(x I ) and q I = q(x I ). Thus, as in other meshless methods [24][25][26][27][28] , the boundary conditions in the present CVBEFM must be dealt with carefully. For problems in potential theory and linear elasticity, the boundary conditions in the boundary node method can be satisfied by coupling discretized BIEs in terms of approximate nodal variables, together with equations relating these approximations to their exact values through the MLS approximation [18] .…”
Section: Discretization For Mixed Boundary Conditionsmentioning
confidence: 99%
“…In this paper, we adopt the multiple-scale technique [28][29] , which is a convenient and effective pre-conditioning technique to reduce the condition number of the resultant matrix of the MPS. Certainly, there also exist other superior methods to deal with the above ill-conditioned problem, such as the finite point method [30] and the localized method of fundamental solutions [31] . Besides, due to the utilization of the concept of localization [31] , the condition number can be markedly decreased, and the error can be analyzed theoretically.…”
Section: Introductionmentioning
confidence: 99%