Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "adaptive method" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Two-dimensional hp-adaptive algorithm for continuous approximations of material data using space projection
Autorzy:
Gurgul, P.
Sieniek, M.
Paszyński, M.
Madej, Ł.
Collier, N.
Powiązania:
https://bibliotekanauki.pl/articles/305268.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
adaptive finite element method
projection operator
digital material representation
Opis:
In this paper we utilize the concept of the L 2 and H 1 projections used to adaptively generate a continuous approximation of an input material data in the finie element (FE) base.This approximation, along with a corresponding FE mesh, can be used as material data for FE solvers. We begin with abrief theoretical background, followed by description of the hp -adaptive algorithm adopted here to improve gradually quality of the projections. We investigate also a few distinct sample problems, apply the aforementioned algorithms and conclude with numerical results evaluation.
Źródło:
Computer Science; 2013, 14 (1); 97-112
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hypergrammar-based parallel multi-frontal solver for grids with point singularities
Autorzy:
Gurgul, P.
Paszyński, M.
Paszyńska, A.
Powiązania:
https://bibliotekanauki.pl/articles/305343.pdf
Data publikacji:
2015
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
hypergraph grammar
direct solver
h-adaptive finite element method
NVIDIA CUDA GPU
Opis:
This paper describes the application of hypergraph grammars to drive a linear computational cost solver for grids with point singularities. Such graph grammar productions are the first mathematical formalisms used to describe solver algorithms, and each indicates the smallest atomic task that can be executed in parallel, which is very useful in the case of parallel execution. In particular,the partial order of execution of graph grammar productions can be found, and the sets of independent graph grammar productions can be localized. They can be scheduled set by set into a shared memory parallel machine. The graph-grammar-based solver has been implemented with NVIDIA CUDA for GPU. Graph grammar productions are accompanied by numerical results for a 2D case. We show that our graph-grammar-based solver with a GPU accelerator is, by order of magnitude, faster than the state-of-the-art MUMPS solver.
Źródło:
Computer Science; 2015, 16 (1); 75-102
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applications of a hyper-graph grammar system in adaptive finite-element computations
Autorzy:
Gurgul, P.
Jopek, K.
Pingali, K.
Paszyńska, A.
Powiązania:
https://bibliotekanauki.pl/articles/331397.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
adaptive finite element method
hypergraph grammar
mesh-based computations
metoda elementów skończonych
gramatyka hipergrafu
siatka obliczeniowa
Opis:
This paper describes application of a hyper-graph grammar system for modeling a three-dimensional adaptive finite element method. The hyper-graph grammar approach allows obtaining a linear computational cost of adaptive mesh transformations and computations performed over refined meshes. The computations are done by a hyper-graph grammar driven algorithm applicable to three-dimensional problems. For the case of typical refinements performed towards a point or an edge, the algorithm yields linear computational cost with respect to the mesh nodes for its sequential execution and logarithmic cost for its parallel execution. Such hyper-graph grammar productions are the mathematical formalism used to describe the computational algorithm implementing the finite element method. Each production indicates the smallest atomic task that can be executed concurrently. The mesh transformations and computations by using the hyper-graph grammar-based approach have been tested in the GALOIS environment. We conclude the paper with some numerical results performed on a shared-memory Linux cluster node, for the case of three-dimensional computational meshes refined towards a point, an edge and a face.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 569-582
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies