2013
DOI: 10.7494/csci.2013.14.1.97
|View full text |Cite
|
Sign up to set email alerts
|

Two-dimensional HP-adaptive Algorithm for Continuous Approximations of Material Data Using Space Projection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…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%
“…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%