2007
DOI: 10.1002/nme.2087
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive multiresolution refinement with distance fields

Abstract: SUMMARYThis paper describes a multiresolution approach to field modeling that can be used with any meshfree or mesh-based method for adaptive solution refinement. The refined solution is represented as a superposition of a coarse (unrefined) solution and a sequence of refinements that provide additional degrees of freedom with higher spatial or functional resolution. Each refinement is treated as a solution to a boundaryvalue problem within a specified refinement window. The proposed approach is based on the m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…Both p and h refinements may be supported, but the global problem must be solved for each refinement, and the shape of refinement regions is determined and limited by the type of basis functions used in Ψ. Another approach to refinement in Tsukanov and Shapiro (2007) advocates representing the refined solution as a series of localized structures, each requiring the solving of a local boundary value problem. Each localization is specified by a refinement window of arbitrary shape, represented implicitly by a normalized window function (ω 1 ≥ 0).…”
Section: Meshfree Modelling and Analysis With Rfmmentioning
confidence: 99%
See 1 more Smart Citation
“…Both p and h refinements may be supported, but the global problem must be solved for each refinement, and the shape of refinement regions is determined and limited by the type of basis functions used in Ψ. Another approach to refinement in Tsukanov and Shapiro (2007) advocates representing the refined solution as a series of localized structures, each requiring the solving of a local boundary value problem. Each localization is specified by a refinement window of arbitrary shape, represented implicitly by a normalized window function (ω 1 ≥ 0).…”
Section: Meshfree Modelling and Analysis With Rfmmentioning
confidence: 99%
“…For example, if the refinement region is contained in the interior of a domain Ω, the Dirichlet solution structure (2.6) is modified as u = ϕ + ωΨ + ω 2 1 H(ω 1 )Ψ 1 , where ω 2 1 ensures C 1 -continuity of the solution field, H(ω 1 ) guarantees that the refined solution does not modify the solution outside the refinement window, and Ψ 1 is a refinement polynomial constructed from a set of additional basis functions. See Tsukanov and Shapiro (2007) for further details and application to more general boundary value problems and refinement windows.…”
Section: Meshfree Modelling and Analysis With Rfmmentioning
confidence: 99%
“…how information is transferred among scales? Among the recent works, we can mention the method of Guidault et al [28] based on the LATIN method and domain decomposition concepts, the multi-grid method proposed in [29], the method of Cloirec et al [30] based on Lagrange multipliers, the multi-scale projection method of Belytschko and coworkers [31,32], the concurrent multi-scale approach of Liu and coworkers [33][34][35], the hp FEM method of Krause et al [36,37], the concurrent multi-level method of Gosh et al [38,39] based on the Voronoi Cell FEM; the multi-resolution approach proposed by Tsukanov and Shapiro [40] based on distance fields. The proposed GFEM gl is also related to the refined global-local FEM proposed by Mao and Sun [41] and based on linear combinations of global and local approximations.…”
Section: Introductionmentioning
confidence: 99%