Numerical solution of obstacle problem by using the mesh-free radial point interpolation method

Document Type : Research Article

Authors

1 Department of Mathematics, Isfahan (Khorasgan) branch, Islamic Azad University, Isfahan, Iran

2 Department of Mathematics, College of Computer and Mathematics, University of Thi-Qar, Iraq

Abstract

The obstacle problem is a well-known type of elliptic variational inequality that originally arose from contact issues in solid mechanics. The solutions to the obstacle problem often have irregularities along a free boundary, which can be effective in designing an appropriate numerical method for these problems.  In this paper, we present a  mesh-free method based on the radial point interpolation method for numerically solving an obstacle problem. In the proposed method, the  radial point interpolating shape functions are utilized in the global weak form of the obstacle problem, based on the element-free Galerkin method. This approach is combined with an active set strategy to address the obstacle problem. One of the key benefits of the proposed method is its independence from any mesh of the computing domain, along with its straightforward implementation and  high numerical stability. To ensure the efficiency of the presented method, we have investigated the convergence of  the proposed method.  The  obtained numerical results confirm the theoretical achievements and demonstrate the method's effectiveness and accuracy.

Keywords

Main Subjects


[16] S. Theodoridis, Machine Learning: A Bayesian and Optimization Perspective, Elsevier, 2020.
[17] L. Wasserman, All of Statistics: A Concise Course in Statistical Inference, Springer, 2004.
[18] L. Xue, X. Zhang, W. Jiang, K. Huo, Q. Shen, A classification performance evaluation measure
considering data separability In L. Iliadis, A. Papaleonidas, P. Angelov, and C. Jayne, editors,
Artificial Neural Networks and Machine Learning – ICANN 2023, pages 1–13, Springer Nature
Switzerland, 2023.
[19] S. Yu, X. Li, Y. Feng, X. Zhang, S. Chen. An instance-oriented performance measure for clas-
sification. Inf. Sci. 580 (2021) 598–619.
[7] M. Hinterm¨uller, K. Ito, K. Kunisch, The primal-dual active set strategy as a semismooth newton
method, SIAM J. Optim. 13 (2002) 865–888.
[8] V. Hrynkiv, Optimal Control of Partial Differential Equations and Variational Inequalities, The
University of Tennessee, 2006.
[9] M. Ilati, Analysis and application of the interpolating element-free galerkin method for extended
Fisher–Kolmogorov equation which arises in brain tumor dynamics modeling, Numer. Algorithms.
85(2020) 485–502.
[10] M. Jalalian, K.W. Ali, S.R. Qadir, M. Jalalian, A numerical method based on the radial basis
functions for solving nonlinear two-dimensional volterra integral equations of the second kind on
non-rectangular domains, J. Math. Model. 12 (2024) 687–705.
[11] M. Jalili, R. Salehi, The approximate solution of one dimensional stochastic evolution equations by
meshless methods, J. Math. Model. 9 (2021) 599–609.
[12] T.K¨arkk¨ainen, K.Kunisch, P.Tarvainen, Augmented lagrangian active set methods for obstacle
problems, J. Optim. Theory Appl. 119 (2003) 499–533.
[13] M. Khaksar-e Oshagh, M. Shamsi, An adaptive wavelet collocation method for solving optimal
control of elliptic variational inequalities of the obstacle type, Comput. Math. Appl. 75 (2018)
470–485.
[14] M. Khaksar-e Oshagh, M. Shamsi, M. Dehghan, A wavelet-based adaptive mesh refinement method
for the obstacle problem, Eng. Comput. 34 (2018) 577–589.
[15] M. Khaksar-e Oshagh, M. Shamsi, Direct pseudo-spectral method for optimal control of obstacle
problem–an optimal control problem governed by elliptic variational inequality, Math. Methods
Appl. Sci. 40 (2017) 4993–5004.
[16] T. Lewis, A. Rapp, Y. Zhang, Convergence analysis of symmetric dual-wind discontinuous galerkin
approximation methods for the obstacle problem, J. Math. Anal. Appl. 485 (2020) 123840.
[17] R. Li, W. Liu, T. Tang, Moving Mesh Finite Element Approximations for Variational Inequality I:
Static Obstacle Problem, Hong Kong Baptist University, Hong Kong, 2000.
[18] X. Li, H. Dong, An element-free galerkin method for the obstacle problem, Appl. Math. Lett. 112
(2021) 106724.
[19] X.P. Lian, Z. Cen, X.L. Cheng, Some iterative algorithms for the obstacle problems, Int. J. Comput.
Math. 87 (2010) 2493–2502.
[20] G.R. Liu, Y. Gu, An introduction to meshfree methods and their programming, Springer Science &
Business Media, 2005.
[21] G. Liu, Y. Gu, A point interpolation method for two-dimensional solids, J. Numer. Methods Eng.
50 (2001) 937–951.
[22] H. Pourbashash, M. Khaksar-e Oshagh, Local RBF-FD technique for solving the two-dimensional
modified anomalous sub-diffusion equation, Appl. Math. Comput. 339 (2018) 144-152.
[23] H. Pourbashash, M. Khaksar-e Oshagh, S. Asadollahi, An efficient adaptive wavelet method for
pricing time-fractional american option variational inequality, Comput. Methods Differ. Equ. 12
(2024) 173–188.
[24] M. Ulbrich, Semismooth Newton methods for variational inequalities and constrained optimization
problems in function spaces, SIAM, 2011.
[25] Z. Wu, R. Schaback, Local error estimates for radial basis function interpolation of scattered data,
IMA J. Numer. Anal. 13 (1993) 13–27.
[26] J. Xiao, M. McCarthy, Meshless analysis of the obstacle problem for beams by the mlpg method
and subdomain variational formulations, Eur. J. Mech. A Solids 22 (2003) 385–399.
[27] M. Yaghouti, H. Ramezannezhad Azarboni, Determining optimal value of the shape parameter c
in RBF for unequal distances topographical points by cross-validation algorithm, J. Math. Model.
5 (2017) 53–60.
[28] D. Yuan, X. Cheng, A meshless method for solving the free boundary problem associated with
unilateral obstacle, Int. J. Comput. Math. 89 (2012) 90–97.
[29] J. X. Zhao, S. Wang, An interior penalty approach to a large-scale discretized obstacle problem
with nonlinear constraints, Numer. Algorithms. 85 (2020) 571–589.
[30] M. Zhao, H. Wu, C. Xiong, Error analysis of hdg approximations for elliptic variational inequality:
obstacle problem, Numer. Algorithms. 81 (2019) 445–463.