Szczegóły publikacji
Opis bibliograficzny
Graph grammar based direct solver for hp-adaptive finite element method with point singularities / Arkadiusz Szymczak, Anna Paszyńska, Piotr GURGUL, Maciej PASZYŃSKI // Procedia Computer Science [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 1877-0509. — 2013 — vol. 18 spec. iss., s. 1594–1603. — Bibliogr. s. 1603, Abstr. — 2013 International Conference on Computational Science / eds. Vassil Alexandrov [et al.]
Autorzy (4)
- AGHSzymczak Arkadiusz
- Paszyńska Anna
- AGHGurgul Piotr
- AGHPaszyński Maciej
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 74206 |
|---|---|
| Data dodania do BaDAP | 2013-07-26 |
| DOI | 10.1016/j.procs.2013.05.327 |
| Rok publikacji | 2013 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Procedia Computer Science |
Abstract
In this paper we present a graph grammar based direct solver algorithm for hp-adaptive finite element method simulations with point singularities. The solver algorithm is obtained by representing computational mesh as a graph and prescribing the solver algorithm by graph grammar productions. Classical direct solvers deliver O(Np-4+N-1.5) computational cost for regular 2D grids, and O(Np-6+N-2) for regular 3D grids, where N denotes number of degrees of freedom and p denotes the polynomial order of approximation. The solver presented in this paper delivers linear computational cost for uniform polynomial order of approximation p. For non-uniform polynomial order the computational cost is almost linear. (C) 2013 The Authors.
