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

A wavelet multi-resolution enabled interpolation Galerkin method for two-dimensional solids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 43 publications
0
10
0
Order By: Relevance
“…However, the proposed method was only verified by nonlinear wave problems in regular spatial domains. For a future study, one may combine the algorithm for wavelet approximation of functions bounded in irregular domain, as we have developed previously [42,43], into the proposed method to solve real engineering problems with irregular shapes/domains.…”
Section: Discussionmentioning
confidence: 99%
“…However, the proposed method was only verified by nonlinear wave problems in regular spatial domains. For a future study, one may combine the algorithm for wavelet approximation of functions bounded in irregular domain, as we have developed previously [42,43], into the proposed method to solve real engineering problems with irregular shapes/domains.…”
Section: Discussionmentioning
confidence: 99%
“…This allows the construction of a wavelet multiresolution approximation format that can suppress numerical instability at the boundaries and perform interpolation at any given point. [122,152] To construct a wavelet multiresolution interpolation that approximates a continuous function, f (x), defined on the region Ω, we first generate a set of completely uniform nodes x n = (k∕2 j 0 , l∕2 j 0 ), which includes all (k, l) satisfying Ω n ∩ Ω ≠ 0, where Ω n is a square with x n as the center and (𝛾 − 1)∕2 j 0 −1 as the side length, and 𝛾 is the order of the wavelet used, as shown in Figure 3. Additional nodes can be added at arbitrary positions.…”
Section: Interpolating Galerkin Methodsmentioning
confidence: 99%
“…, where the function 𝜌(n) ≥ j 0 returns the smallest integer that makes both k(n) = 2 𝜌(n) x n and l(n) = 2 𝜌(n) y n integers. [122,152] Based on this node distribution, a multiresolution approximation of f(x) can be expressed as: [133,170] f (x) ≈ P…”
Section: Interpolating Galerkin Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…For general practical problems, Ω is a finite domain. We apply the boundary extension technique in our previous study based on the Lagrange interpolation to remove local errors induced by a loss of information outside the domain [29,30]. For all functions in 2 () L Ω , the modified wavelet approximation at the resolution level J can be written as…”
Section: Approximation Of Functions On a Finite Domainmentioning
confidence: 99%