Abstract
A novel wavelet multiresolution interpolation formula is developed for approximating continuous functions defined on an arbitrary two-dimensional domain represented by a set of scattered nodes. The present wavelet interpolant is created explicitly without the need for matrix inversion. It possesses the Kronecker delta function property and does not contain any ad-hoc parameters, leading to an excellent stability and usefulness for function approximation. Using the wavelet multiresolution interpolant to construct trial and weight functions, a wavelet multiresolution interpolation Galerkin method (WMIGM) is proposed for solving elasticity problems. In this WMIGM, the essential boundary conditions can be imposed with ease as in the conventional finite element method. The stiffness matrix can be efficiently obtained through semi-analytical integration using an underlying general database, instead of the numerical integration usually requiring a mesh. The accuracy of the WMIGM is examined through theoretical analysis and benchmark problems. Results demonstrate that the proposed WMIGM has an excellent accuracy, optimal rate of convergence and competitive efficiency, as well as an excellent stability against irregular nodal distribution. Most importantly, by adding more nodes into local region only, a high resolution of localized steep gradients can be achieved as desired without changing the existing nodes.
Similar content being viewed by others
References
Liu GR (2009) Meshfree methods: moving beyond the finite element method, 2nd edn. CRC Press, Boca Raton
Liu GR, Quek SS (2013) The finite element method—a practical course, 2nd edn. Butterworth-Heinemann, Waltham
Li B, Chen X (2014) Wavelet-based numerical analysis: a review and classification. Finite Elem Anal Des 81:14–31
Lu YY, Belytschko T, Tabbara M (1995) Element-free Galerkin method for wave propagation and dynamic fracture. Comput Methods Appl Mech Eng 126:131–153
Chen L, Rabczuk T, Bordas SPA, Liu GR, Zeng KY, Kerfriden P (2012) Extended finite element method with edge-based strain smoothing (ESm-XFEM) for linear elastic crack growth. Comput Methods Appl Mech Eng 209:250–265
Liu GR (2016) An overview on meshfree methods: for computational solid mechanics. Int J Comput Methods 13:1630001
Nayroles B, Touzot G, Villon P (1992) Generalizing the finite element method: diffuse approximation and diffuse elements. Comput Mech 10:307–318
Belytschko T, Lu YY, Gu L (1994) Element-free Galerkin methods. Int J Numer Meth Eng 37:229–256
Garg S, Pant M (2018) Meshfree methods: a comprehensive review of applications. Int J Comput Methods 15:1830001
Belytschko T, Lu YY, Gu L, Tabbara M (1995) Element-free Galerkin methods for static and dynamic fracture. Int J Solids Struct 32:2547–2570
Rabczuk T, Belytschko T (2007) A three-dimensional large deformation meshfree method for arbitrary evolving cracks. Comput Methods Appl Mech Eng 196:2777–2799
Li W, Nguyen-Thanh N, Zhou K (2018) Geometrically nonlinear analysis of thin-shell structures based on an isogeometric-meshfree coupling approach. Comput Methods Appl Mech Eng 336:111–134
Zhang T, Li X (2018) A generalized element-free Galerkin method for Stokes problem. Comput Math Appl 75:3127–3138
Hostos JCA, Bencomo AD, Cabrera ESP (2018) Simple iterative procedure for the thermal–mechanical analysis of continuous casting processes using the element-free Galerkin method. J Therm Stresses 41:160–181
Rabczuk T, Belytschko T (2005) Adaptivity for structured meshfree particle methods in 2D and 3D. Int J Numer Methods Eng 63:1559–1582
Beissel S, Belytschko T (1996) Nodal integration of the element-free Galerkin method. Comput Methods Appl Mech Eng 139:49–74
Liu GR, Zhang GY, Wang YY, Zhong ZH, Li GY, Han X (2007) A nodal integration technique for meshfree radial point interpolation method (NI-RPIM). Int J Solids Struct 44:3840–3860
Krongauz Y, Belytschko T (1996) Enforcement of essential boundary conditions in meshless approximations using finite elements. Comput Methods Appl Mech Eng 131:133–145
Mukherjee YX, Mukherjee S (1997) On boundary conditions in the element-free Galerkin method. Comput Mech 19:264–270
Liu GR, Gu YT (2001) A point interpolation method for two-dimensional solids. Int J Numer Meth Eng 50:937–951
Wang JG, Liu GR (2002) A point interpolation meshless method based on radial basis functions. Int J Numer Meth Eng 54:1623–1648
Liu GR, Zhang GY (2013) Smoothed point interpolation methods-G space theory and weakened weak forms. World Scientific, Singapore
Gu YT, Wang W, Zhang LC, Feng XQ (2011) An enriched radial point interpolation method (e-RPIM) for analysis of crack tip fields. Eng Fract Mech 78:175–190
Kazemi Z, Hematiyan MR, Vaghefi R (2017) Meshfree radial point interpolation method for analysis of viscoplastic problems. Eng Anal Boundary Elem 82:172–184
Dehghan M, Haghjoo-Saniji M (2017) The local radial point interpolation meshless method for solving Maxwell equations. Eng Comput 33:897–918
Feng SZ, Li AM (2017) Analysis of thermal and mechanical response in functionally graded cylinder using cell-based smoothed radial point interpolation method. Aerosp Sci Technol 65:46–53
Liu WK, Jun S, Zhang YF (1995) Reproducing kernel particle method. Int J Numer Methods Fluids 20:1081–1106
Li S, Liu WK (1999) Reproducing kernel hierarchical partition of unity, part I-formulation and theory. Int J Numer Methods Eng 45:251–288
Wagner GJ, Liu WK (2000) Application of essential boundary conditions in mesh-free methods: a corrected collocation method. Int J Numer Methods Eng 47:1367–1379
Chen JS, Han W, You Y, Meng X (2003) A reproducing kernel method with nodal interpolation property. Int J Numer Methods Eng 56:935–960
Liu WK, Li S, Belytschko T (1997) Moving least-square reproducing kernel methods (I) methodology and convergence. Comput Methods Appl Mech Eng 143:113–154
Li S, Liu WK (1996) Moving least-square reproducing kernel method part II: Fourier analysis. Comput Methods Appl Mech Eng 139:159–193
Liu WK, Han W, Lu H, Li S, Cao J (2004) Reproducing kernel element method. Part I: theoretical formulation. Comput Methods Appl Mech Eng 193:933–951
Li S, Lu H, Han W, Liu WK, Simkins DC (2004) Reproducing kernel element method part II: globally conforming I m/C n hierarchies. Comput Methods Appl Mech Eng 193:953–987
Lu H, Li S, Simkins DC Jr, Liu WK, Cao J (2004) Reproducing kernel element method part III: generalized enrichment and applications. Comput Methods Appl Mech Eng 193:989–1011
Wagner GJ, Liu WK (2001) Hierarchical enrichment for bridging scales and mesh-free boundary conditions. Int J Numer Methods Eng 50:507–524
Liu X, Wang J, Zhou Y, Wang J (2017) Wavelet methods and applications in nonlinear mechanics problems. Chin J Solid Mech 38:287–310
Meyer Y (1992) Wavelets and operators. Cambridge University Press, Cambridge
Yang Z, Liao S (2017) A HAM-based wavelet approach for nonlinear ordinary differential equations. Commun Nonlinear Sci Numer Simul 48:439–453
Chen X, Yang S, Ma J, He Z (2004) The construction of wavelet finite element and its application. Finite Elem Anal Des 40:541–554
Vasilyev OV, Kevlahan NKR (2005) An adaptive multilevel wavelet collocation method for elliptic problems. J Comput Phys 206:412–431
Liu X, Zhou Y, Wang X, Wang J (2013) A wavelet method for solving a class of nonlinear boundary value problems. Commun Nonlinear Sci Numer Simul 18:1939–1948
Yang Z, Liao S (2018) On the generalized wavelet-Galerkin method. J Comput Appl Math 331:178–195
Liu X, Wang J, Zhou Y (2017) A space–time fully decoupled wavelet Galerkin method for solving a class of nonlinear wave problems. Nonlinear Dyn 90:599–616
Liu Y, Liu Y, Cen Z (2011) Multi-scale Daubechies wavelet-based method for 2-D elastic problems. Finite Elem Anal Des 47:334–341
Bertoluzza S, Naldi G, Ravel JC (1994) Wavelet methods for the numerical solution of boundary value problems on the interval. Wavelet Anal Appl 5:425–448
Jang GW, Kim JE, Kim YY (2004) Multiscale Galerkin method using interpolation wavelets for two-dimensional elliptic problems in general domains. Int J Numer Methods Eng 59:225–253
Sannomaru S, Tanaka S, Yoshida K, Bui TQ, Okazawa S, Hagihara S (2017) Treatment of Dirichlet-type boundary conditions in the spline-based wavelet Galerkin method employing multiple point constraints. Appl Math Model 43:592–610
Tanaka S, Okada H (2012) A wavelet Galerkin method employing B-spline bases for solid mechanics problems without the use of a fictitious domain. Comput Mech 50:35–48
Donoho DL (1992) Interpolating wavelet transforms. Technical Report 408, Department of Statistics, Stanford University
Beylkin G (1992) On the representation of operators in bases of compactly supported wavelet. SIAM J Numer Anal 29:1716–1740
Chen MQ, Hwang C, Shih YP (1996) The computation of wavelet-Galerkin approximation on a bounded interval. Int J Numer Methods Eng 39:2921–2944
Zhang T, Tian YC, Tade MO, Utomo J (2007) Comments on ‘The computation of wavelet-Galerkin approximation on a bounded interval’. Int J Numer Methods Eng 72:244–251
Maz’ya V (2011) Sobolev spaces with applications to elliptic partial differential equations, 2nd edn. Springer, New York
Resnikoff HL, Wells ROJ (1998) Wavelet analysis: the scalable structure information. Springer, New York
Gasca M, Sauerb T (2000) On the history of multivariate polynomial interpolation. J Comput Appl Math 122:23–35
Kincaid D, Cheney W (2002) Numerical analysis: mathematics of scientific computing, 3rd edn. American Mathematical Society, Providence
Kattan PI (2003) MATLAB guide to finite elements: an interactive approach. Springer, New York
Timoshenko S, Goodier JN (1951) Theory of elasticity, 2nd edn. McGraw-Hill, New York
Kim CG, Park J (1998) The condition number of stiffness matrix under p-version of the FEM. Kangweon-Kyungki Math J 6:17–26
Acknowledgements
This research is supported by grants from the National Natural Science Foundation of China (11502103), and the State Scholarship Fund of China Scholarship Council (201706185027).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Appendices
Appendix A: Proof of the decomposition (2.7)
Substituting the two-scale relation (2.3) into the approximation (2.6), yields
in which the property \( p_{k} = \delta_{0,k} \) for \( k \in Even \) is considered. Following this property and Eq. (2.3), there is the relation
where \( k \in Even \) and \( l \in Odd \). By using the same method, we also can obtain the relations
and
Substituting Eqs. (A.2–A.4) into Eq. (A.1), yields
in which \( \Re \) is the set of all integer pair (k, l) in which at least one element is an odd number.
Finally, we can obtain \( R^{j} f({\mathbf{x}}) \) defined by Eq. (2.8) by subtracting \( S^{j} f({\mathbf{x}}) \) given by Eq. (A.5) from \( S^{j + 1} f({\mathbf{x}}) \) shown in Eq. (2.6).
Appendix B: Proof of Theorem 2.2
Since \( f({\mathbf{x}}) \) is sufficiently smooth in the domain \( \Omega \), one always can find a proper supplement of the definition of function \( f({\mathbf{x}}) \) in the domain \( \bar{\Omega } \) such that \( f({\mathbf{x}}) \) is smooth enough in the domain \( \Omega \cup \bar{\Omega } \) [54]. Then following Eqs. (2.12–2.15), we have
By applying Theorem 2.1 and Eq. (B.1), one can obtain
Since \( \tilde{f}_{l} ({\mathbf{x}}) \) is a Lagrange interpolation with order \( \eta_{l} \) of function \( f({\mathbf{x}}) \), by using the relations \( |x_{l} - \tilde{x}_{l,i} | \le \zeta_{1} 2^{ - j} \) and \( |y_{l} - \tilde{y}_{l,i} | \le \zeta_{2} 2^{ - j} \) given in Sect. 2.2, we have [56, 57]
in which \( \varepsilon_{2} \) is a constant with the property \( \varepsilon_{2} = 0 \) for \( D_{{\eta_{l} }}^{0} f({\mathbf{x}}) = D_{{\eta_{l} }}^{{\eta_{l} }} f({\mathbf{x}}) \equiv 0 \). On the other hand, considering \( \theta_{j,k,l} ({\mathbf{x}}) \in C_{0}^{\gamma /2 - 1} \Omega_{j,k,l}^{\inf } \), one can obtain
which implies that there are at most \( (2\gamma - 3)^{2} \) wavelet basis functions \( \theta_{j,k,l} ({\mathbf{x}}) \ne 0 \) for any point x. Therefore, Eq. (B.2) can be expressed as
where the constant \( C_{2,\infty } = 0 \), if \( D_{\lambda }^{0} f({\mathbf{x}}) = D_{\lambda }^{\lambda } f({\mathbf{x}}) \equiv 0 \). By applying Eq. (B.5), Eq. (2.18) can be obtained readily [54, 55].
Appendix C: Proof of Proposition 2.1
By applying the property of the modified wavelet basis \( \varphi_{j,l} ({\mathbf{x}}_{k} ) = \delta_{k,l} \) for \( k,l = 1,2, \ldots N_{i} \) given in Sect. 2.2, we can obtain directly
On the other hand, we assume that for \( j_{0} \le o < J \) there is the relation
Then following Eqs. (2.20–2.22), we have
where \( (n,m) \in \Re_{j} \) and \( j_{0} \le j \le o + 1 \).
Due to \( \theta (q) = \delta_{0,q} \) for all \( q \in {\mathbb{Z}} \), there is \( \theta_{o + 1,k,l} ({\mathbf{x}}_{j,n,m} ) = \theta (2^{o + 1 - j} n - k)\theta (2^{o + 1 - j} m - l) = 0 \) for all nodes \( {\mathbf{x}}_{j,n,m} \), \( j_{0} \le j \le o \), because both of \( 2^{o + 1 - j} n \) and \( 2^{o + 1 - j} m \) are even numbers, and at least one of k and l is odd number. Therefore, Eq. (C.3) and the assumption (C.2) state
For \( j = o + 1 \), by using the property \( \theta_{o + 1,k,l} ({\mathbf{x}}_{o + 1,n,m} ) = \delta_{n,k} \delta_{m,l} \), Eq. (C.3) can be reduced into
Finally, one can obtain Proposition 2.1 by combining the recurrence relations (C.2, C.6) with the starting condition (C.1).
Appendix D: Proof of Theorem 2.3
Following the relations (2.19, 2.20), for \( n > j_{0} \) there is the relation
By applying \( \theta_{j,k,l} ({\mathbf{x}}) \in C_{0}^{\gamma /2 - 1} \Omega_{j,k,l}^{\inf } \) and Eq. (B.4), Eq. (D.1) can be expressed as
in which \( \varepsilon_{3} \) is a constant. By using Eq. (D.2) iteratively, and considering \( P_{{j_{0} }}^{{j_{0} }} f({\mathbf{x}}) = S_{L}^{{j_{0} }} f({\mathbf{x}}) \) and Theorem 2.2, we have
where \( \varepsilon_{4} \) is a constant, and the constant \( C_{3,\infty } = 0 \) if \( D_{\lambda }^{0} f({\mathbf{x}}) = D_{\lambda }^{\lambda } f({\mathbf{x}}) \equiv 0 \). On the basis of Eq. (D.3), it is very easy to check Eq. (2.23), as well as Eq. (2.24) [54, 55].
Appendix E: Evaluation of connection coefficients
Since \( \theta^{(\alpha )} (x) = 0 \), \( \alpha = 0,1, \ldots ,\gamma /2 \) for \( |x| > \gamma - 1 \), by directly examining the definition (4.23) of the three-term multiresolution connection coefficient \( \Gamma_{k,l}^{n,m} (j_{1} ,j_{2} ,x) \), one can obtain directly
and
Then, substituting the two-scale relation (2.3) into Eq. (4.23), and applying Eq. (E.2), we have
and
One can see that the coefficients \( \Gamma_{k,l}^{n,m} (j_{1} ,0,x) \) for \( j_{1} \ge 1 \) can be obtained readily by applying Eq. (E.3) iteratively, when the coefficients \( \Gamma_{k,l}^{n,m} (0,0,x) \) are known. Then, the connection coefficients \( \Gamma_{k,l}^{n,m} (j_{1} ,j_{2} ,x) \) for \( j_{1} ,j_{2} \ge 0 \) and \( k,l \in {\mathbb{Z}} \) can be evaluated through \( \Gamma_{k,l}^{n,m} (j_{1} ,0,x) \) and Eq. (E.4).
Further, the coefficient \( \Gamma_{k,l}^{n,m} (0,0,x) \) can be expressed as
where the classical three-term connection coefficient [52, 53]
which possesses the properties [52, 53]
and
Substituting the two-scale relation (2.3) into Eq. (E.6), and applying Eq. (E.8), yields
It can be found that the values of \( \Gamma_{k,l}^{n,m} (x) \) at all dyadic points \( x = k/2^{j} \) can be obtained readily, if the values of \( \Gamma_{k,l}^{n,m} (x) \) values at integer points are known. These values at integer points can be evaluated by using a modified version of the algorithm which is developed for orthogonal wavelets by Chen et al. [52] and Zhang et al. [53]. In the following, an alternative method which is much easier to implement compared with the existing algorithm [52, 53] will be proposed. This algorithm also can be directly extended to calculate the three-term connection coefficient for other wavelets.
For integer x, there is the relation
where the integral
It can be seen from Eq. (E.10) that the values of \( \Gamma_{k,l}^{n,m} (x) \) at integer points can be obtained readily, when the integrals \( \Lambda_{i,j,k}^{n,m} \) are known. Considering \( \theta^{(\alpha )} (x) = 0 \), \( \alpha = 0,1, \ldots ,\gamma /2 \) for \( |x| > \gamma - 1 \), it is easy to check the relation
Substituting the two-scale relation (2.3) into Eq. (E.11), and applying Eq. (E.12), one can obtain
Letting \( i,j,{\text{and }}k = 2 - \gamma ,3 - \gamma , \ldots ,\gamma - 1 \), respectively in Eq. (E.13), yields
in which the matrix \( {\mathbf{B}} = \{ b_{gh} = 2^{n + m - 1} (p_{l - 2i} p_{o - 2j} p_{q - 2k} + p_{l - 2i + 1} p_{o - 2j + 1} p_{q - 2k + 1} )\} \), the vector \( {\varvec{\Lambda}}^{n,m} = \{ \Lambda_{g}^{n,m} = \Lambda_{i,j,k}^{n,m} \}^{\text{T}} \), and subscripts \( g = (i + \gamma - 2)(2\gamma - 2)^{2} + (j + \gamma - 2)(2\gamma - 2) + k + \gamma - 1 \) and \( h = (l + \gamma - 2)(2\gamma - 2)^{2} + (o + \gamma - 2)(2\gamma - 2) + q + \gamma - 1 \).
One can see from Eq. (E.14) that \( {\varvec{\Lambda}}^{n,m} \) is an eigenvector of the matrix B corresponding to the unit eigenvalue. It can be found by numerical experiment that there are \( 1 \le \bar{\mu } \le (n + m + 1)(n + m + 2)/2 \) linearly independent eigenvectors \( {\bar{\mathbf{\Lambda }}}_{o}^{n,m} = \{ \bar{\Lambda }_{o,i,j,k}^{n,m} \}^{\text{T}} \), \( o = 1,2, \ldots ,\bar{\mu } \), whose eigenvalues are all equivalent to 1. Thus, the integral \( \Lambda_{i,j,k}^{n,m} \) can be expressed as
where the coefficients \( \lambda_{o} \) for \( o = 1,2, \ldots ,\bar{\mu } \) should be determined by additional constraint conditions.
Based on Theorem 2.1, one can obtain
where \( a,b,c = 0,1, \ldots ,\gamma - 1 \) and \( d! = \infty \) for \( d < 0 \). Based on Eq. (E.16), we have
Integrating both sides of Eq. (E.17) over [0, 1], yields
Substituting Eq. (E.15) into Eq. (E.18), gives
We note that Eq. (E.19) includes \( \gamma^{3} \) equations for coefficients \( \lambda_{o} \), \( o = 1,2, \ldots ,\bar{\mu } \), which is an over-determined linear system, since \( \bar{\mu } \le (n + m + 1)(n + m + 2)/2 \le (\gamma + 1)(\gamma + 2)/2 < \gamma^{3} \). But the numerical experiment shows that this over-determined linear system is compatible. Therefore, the coefficients \( \lambda_{o} \) can be determined by using the least square method to solve Eq. (E.19). Once these coefficients are obtained, the integral \( \Lambda_{i,j,k}^{n,m} \) can be evaluated through Eq. (E.15). Then, the values of \( \Gamma_{k,l}^{n,m} (x) \) at integer points can be calculated by Eq. (E.10). Based on these basic data values, one can obtain the three-term multiresolution connection coefficient \( \Gamma_{k,l}^{n,m} (j_{1} ,j_{2} ,x) \) with ease, by using the relations (E.9, E.5, E.3, E.4) in sequence.
For the two-term multiresolution connection coefficient \( {\rm T}_{j,k}^{n,m} (x) \) defined by Eq. (4.24), by considering \( \theta^{(\alpha )} (x) = 0 \), \( \alpha = 0,1, \ldots ,\gamma /2 \) for \( |x| > \gamma - 1 \), there are also the following relations
and
By considering \( \theta (x) = 0 \) for \( |x| > \gamma - 1 \), Eq. (E.16) gives
where \( [x] \) is the nearest integer to x. Substituting Eq. (E.22) into Eq. (4.24), yields
It can be seen that the two-term multiresolution connection coefficient \( {\rm T}_{j,k}^{n,m} (x) \) can be obtained based on Eq. (E.23) and the three-term multiresolution connection coefficient \( \Gamma_{k,l}^{n,m} (j_{1} ,j_{2} ,x) \).
Rights and permissions
About this article
Cite this article
Liu, X., Liu, G.R., Wang, J. et al. A wavelet multiresolution interpolation Galerkin method for targeted local solution enrichment. Comput Mech 64, 989–1016 (2019). https://doi.org/10.1007/s00466-019-01691-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00466-019-01691-6