An h-adaptive refinement scheme is established based on local error analysis. The errors are assessed with an ad hoc uniform norm intrinsic to the collocation BEM used. The errors are assessed with an ad hoc uniform norm intrinsic to the collocation BEM used.
In typical h-refinement, this is defined by the mesh-refinement method applied to finite elements or volumes. The proposed method refines the solution space by splitting the support of the basis vectors using a tree structure constructed via k-means clustering of the state variables.
3/15/1997 · NORTH= HOt,LAND A New h-Adaptive Refinement Scheme for the Boundary Element Method Using Local Reanalysis A. Charafi School of Mathematical Studies University of Portsmouth Portsmouth POI 2EG, UK and L. C. Wrobel Department of Mechanical Engineering Brunel University Middlesex UB8 3PH, UK Transmitted by M. A. Golberg ABSTRACT This paper …
7/1/2001 · An h-adaptive refinement scheme is established based on local error analysis. The errors are assessed with an ad hoc uniform norm intrinsic to the collocation BEM used. The errors are assessed with an ad hoc uniform norm intrinsic to the collocation BEM used.
5/4/2015 · In [37], an h-adaptive refinement of the basis vectors uses clustering algorithms to learn and adapt a reduced basis from high-fidelity model residuals. The work [4] adapts localized reduced bases…
5/4/2015 · The technique is analogous to mesh?adaptive h?refinement: it enriches the reduced?basis space online by ‘splitting’ a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive k?means clustering of the state variables using snapshot data.
1/1/2020 · In the proposed h-adaptive scheme, the coarse element will firstly be enriched by a group of SPG particles (called the SPG group in this paper) when the damage indicator D ¯ reaches a certain value. This value is a numerical parameter that is smaller than the.
12/12/2017 · The general idea is that when the exact solution is smooth on the given element, p-adaptive refinement is more efficient and leads to a faster convergence with respect to the number of degrees of freedom; whereas if the solution is non-smooth (singular), h-adaptive refinement is performed.
12/1/2017 · The purpose of this example is not to emphasize on the efficiency of the h-adaptive RBF-FD method. Rather, we would like to point out that the h-adaptive RBF-FD method can apply to the high-dimensional problem. The h-adaptive RBF-FD method is able to obtain a good result compared with the uniform nodal distribution for the Dirichlet problem.
A Hybrid Substructuring Method and an Adaptive Refinement Scheme for the Distributed Solution of Three-Dimensional Structural Problems 921082 A saddle-point variational principle is constructed to derive a hybrid substructuring method for the parallel solution of …
