International Journal of Applied Mathematics and Computer Science > 2017 > Vol. 27, no. 2 > 351--365
Source
Abstract
Identifiers
journal ISSN : | 1641-876X |
journal e-ISSN : | 2083-8492 |
DOI | 10.1515/amcs-2017-0025 |
Authors
Keywords
Additional information
Fields of science
Bibliography
-
[1] AbouEisha, H., Calo, V.M., Jopek, K.,Moshkov, M., Paszyńska, A., Paszyński, M. and Skotniczny, M. (2016). Element partition trees for two- and three-dimensional h-refined meshes and their use to optimize direct solver performance. Part II: Heuristic algorithms, Journal of Computational and Applied Mathematics, (submitted).
-
[2] AbouEisha, H., Gurgul, P., Paszyńska, A., Paszyński, M., Kuźnik, K. and Moshkov, M. (2015). An automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshes, in R. Wyrzykowski et al. (Eds.), Parallel Processing and Applied Mathematics, Lecture Notes in Computer Science, Vol. 8385, Springer, Berlin/Heidelberg, pp. 531–540.
-
[3] AbouEisha, H., Moshkov, M. Calo, V.M., Paszyński, M., Goik, D. and Jopek, K. (2014). Dynamic programming algorithm for generation of optimal elimination trees for multi-frontal direct solver over h-refined grids, Procedia Computer Science 29: 947–959.