2013
DOI: 10.1016/j.jocs.2011.07.002
|View full text |Cite
|
Sign up to set email alerts
|

Application of multi-agent paradigm to hp-adaptive projection-based interpolation operator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…The projection‐based interpolation method comes to the aid in the case of reducing computational time. Although unaware of the elasticity problem to be solved, this method adapts the computational mesh around the interface between material phases and around boundaries with linear rather than quadratic computational complexity . After a couple of steps, finite elements still need to be used to adapt the mesh around solution peculiarities (problem‐specific!)…”
Section: Proposed Workflow Improvementmentioning
confidence: 99%
See 1 more Smart Citation
“…The projection‐based interpolation method comes to the aid in the case of reducing computational time. Although unaware of the elasticity problem to be solved, this method adapts the computational mesh around the interface between material phases and around boundaries with linear rather than quadratic computational complexity . After a couple of steps, finite elements still need to be used to adapt the mesh around solution peculiarities (problem‐specific!)…”
Section: Proposed Workflow Improvementmentioning
confidence: 99%
“…This time, however, the FEM computations can be much shorter, thanks to the pre‐adaptation performed in this step. For more information on h‐PBI please refer to (2D) and (3D).…”
Section: Pre‐adapting Mesh With Adaptive Projection‐based Interpolationmentioning
confidence: 99%
“…In this paper, we present an alternative projection-based interpolation solver that reduces the computational cost to O(N ) in the case of sequential execution and even further to O( N c ) when we use c cores. The projection-based interpolation technique has been successfully used for generating continuous approximations of two-or threedimensional bitmaps, with applications to material science [10,11,12,15] or modeling of the human head [8]. In this paper, we focus on utilizing the Projection-Based Interpolation (PBI) algorithm for solving a sequence of projection problems arising from the Euler scheme used for time discretization of non-stationary problems.…”
Section: Introductionmentioning
confidence: 99%
“…The importance of even preliminary version of such an algorithm has already been proven ( [3], [9]). …”
Section: Introductionmentioning
confidence: 99%
“…The method described in this paper differs from the Projection-Based Interpolation (PBI) operator, researched by some of the authors of this paper in [9] and [3]. PBI also delivers H 1 interpolations of an input function, but does not guarantee their optimality for the given amount of degrees of freedom.…”
Section: Introductionmentioning
confidence: 99%