Hypergraph grammar based linear computational cost solver for three dimensional grids with point singularities

2014
journal article
article
dc.abstract.enIn this paper we present a hypergraph grammar based multi-frontal solver for three dimensional grids with point singularities. We show experimentally that the computational cost of the resulting solver algorithm is linear with respect to the number of degrees of freedom. We also propose a reutilization algorithm that enables to reuse LU factorizations over unrefined parts of the mesh when new local refinements are executed by the hypergraph grammar productions.pl
dc.affiliationWydział Fizyki, Astronomii i Informatyki Stosowanej : Zakład Projektowania i Grafiki Komputerowejpl
dc.contributor.authorGurgul, Piotrpl
dc.contributor.authorPaszyńska, Anna - 160672 pl
dc.contributor.authorPaszyński, Maciejpl
dc.date.accessioned2015-05-27T10:29:57Z
dc.date.available2015-05-27T10:29:57Z
dc.date.issued2014pl
dc.date.openaccess0
dc.description.accesstimew momencie opublikowania
dc.description.physical1078-1089pl
dc.description.publication1pl
dc.description.versionostateczna wersja wydawcy
dc.description.volume29pl
dc.identifier.doi10.1016/j.procs.2014.05.097pl
dc.identifier.eissn1877-0509pl
dc.identifier.urihttp://ruj.uj.edu.pl/xmlui/handle/item/8218
dc.languageengpl
dc.language.containerengpl
dc.rightsDodaję tylko opis bibliograficzny*
dc.rights.licenceCC-BY-NC-ND
dc.rights.uri*
dc.share.typeotwarte czasopismo
dc.subject.enhypergraph grammarpl
dc.subject.endirect solverpl
dc.subject.enreuitlizationpl
dc.subject.enh adaptivitypl
dc.subtypeArticlepl
dc.titleHypergraph grammar based linear computational cost solver for three dimensional grids with point singularitiespl
dc.title.journalProcedia Computer Sciencepl
dc.title.volume2014 International Conference on Computational Sciencepl
dc.typeJournalArticlepl
dspace.entity.typePublication
dc.abstract.enpl
In this paper we present a hypergraph grammar based multi-frontal solver for three dimensional grids with point singularities. We show experimentally that the computational cost of the resulting solver algorithm is linear with respect to the number of degrees of freedom. We also propose a reutilization algorithm that enables to reuse LU factorizations over unrefined parts of the mesh when new local refinements are executed by the hypergraph grammar productions.
dc.affiliationpl
Wydział Fizyki, Astronomii i Informatyki Stosowanej : Zakład Projektowania i Grafiki Komputerowej
dc.contributor.authorpl
Gurgul, Piotr
dc.contributor.authorpl
Paszyńska, Anna - 160672
dc.contributor.authorpl
Paszyński, Maciej
dc.date.accessioned
2015-05-27T10:29:57Z
dc.date.available
2015-05-27T10:29:57Z
dc.date.issuedpl
2014
dc.date.openaccess
0
dc.description.accesstime
w momencie opublikowania
dc.description.physicalpl
1078-1089
dc.description.publicationpl
1
dc.description.version
ostateczna wersja wydawcy
dc.description.volumepl
29
dc.identifier.doipl
10.1016/j.procs.2014.05.097
dc.identifier.eissnpl
1877-0509
dc.identifier.uri
http://ruj.uj.edu.pl/xmlui/handle/item/8218
dc.languagepl
eng
dc.language.containerpl
eng
dc.rights*
Dodaję tylko opis bibliograficzny
dc.rights.licence
CC-BY-NC-ND
dc.rights.uri*
dc.share.type
otwarte czasopismo
dc.subject.enpl
hypergraph grammar
dc.subject.enpl
direct solver
dc.subject.enpl
reuitlization
dc.subject.enpl
h adaptivity
dc.subtypepl
Article
dc.titlepl
Hypergraph grammar based linear computational cost solver for three dimensional grids with point singularities
dc.title.journalpl
Procedia Computer Science
dc.title.volumepl
2014 International Conference on Computational Science
dc.typepl
JournalArticle
dspace.entity.type
Publication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
8
Views per month
Views per city
Ashburn
2
Wroclaw
2
Dublin
1

No access

No Thumbnail Available