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ę "Paszyński, M" wg kryterium: Autor


Wyświetlanie 1-4 z 4
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ł:
Heuristic algorithm to predict the location of C0 separators for efficient isogeometric analysis simulations with direct solvers
Autorzy:
Paszyńska, A.
Jopek, K.
Woźniak, M.
Paszyński, M.
Powiązania:
https://bibliotekanauki.pl/articles/201497.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
refined isogeometric analysis
finite element method
multi-frontal direct solver
heuristic algorithms
analiza izogeometryczna
metoda elementów skończonych
algorytmy heurystyczne
Opis:
We focus on two and three-dimensional isogeometric finite element method computations with tensor product Ck B-spline basis functions. We consider the computational cost of the multi-frontal direct solver algorithm executed over such tensor product grids. We present an algorithm for estimation of the number of floating-point operations per mesh node resulting from the execution of the multi-frontal solver algorithm with the ordering obtained from the element partition trees. Next, we propose an algorithm that introduces C0 separators between patches of elements of a given size based on the stimated number of flops per node. We show that the computational cost of the multi-frontal solver algorithm executed over the computational grids with C0 separators introduced is around one or two orders of magnitude lower, while the approximability of the functional space is improved. We show O(NlogN) computational complexity of the heuristic algorithm proposing the introduction of the C0 separators between the patches of elements, reducing the computational cost of the multi-frontal solver algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 907-917
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using a graph grammar system in the finite element method
Autorzy:
Strug, B.
Paszyńska, A.
Paszyński, M.
Grabska, E.
Powiązania:
https://bibliotekanauki.pl/articles/330662.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
graph grammar system
automatic hp adaptivity
finite element method
gramatyka grafowa
adaptacja automatyczna
metoda elementów skończonych
Opis:
The paper presents a system of Composite Graph Grammars (CGGs)modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values to element nodes and perform h- and p-adaptations. The CGG system is illustrated with an example from the domain of geophysics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 839-853
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Element partition trees for h-refined meshes to optimize direct solver performance. Part I: Dynamic programming
Autorzy:
Aboueisha, H.
Calo, V. M.
Jopek, K.
Moshkov, M.
Paszyńska, A.
Paszyński, M.
Skotniczny, M.
Powiązania:
https://bibliotekanauki.pl/articles/330823.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
h-adaptive finite element method
ordering
element partition tree
extensions of dynamic programming
multifrontal direct solvers
metoda elementów skończonych
porządkowanie danych
programowanie dynamiczne
Opis:
We consider a class of two- and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive grids.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 351-365
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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