Szczegóły publikacji

Opis bibliograficzny

Complexity of direct and iterative solvers on space–time formulations and time-marching schemes for h-refined grids towards singularities / Marcin SKOTNICZNY, Anna Paszyńska, Sergio Rojas, Maciej PASZYŃSKI // Journal of Computational Science ; ISSN 1877-7503. — 2024 — vol. 76 art. no. 102216, s. 1–17. — Bibliogr. s. 16–17, Abstr. — Publikacja dostępna online od: 2024-01-17


Autorzy (4)


Słowa kluczowe

space-time formulationsh refinementsmulti-frontal solvertime marching schemeiterative solverscomputational complexity

Dane bibliometryczne

ID BaDAP151581
Data dodania do BaDAP2024-03-11
Tekst źródłowyURL
DOI10.1016/j.jocs.2024.102216
Rok publikacji2024
Typ publikacjiartykuł w czasopiśmie
Otwarty dostęptak
Czasopismo/seriaJournal of Computational Science

Abstract

We study computational complexity aspects for Finite Element formulations considering hypercubic space–time full and time-marching discretization schemes for h-refined grids towards singularities. We perform a relatively comprehensive study comparing the computational time via time complexities of direct and iterative solvers. We focus on the space–time formulation with refined computational grids and the corresponding time slabs, namely, computational grids obtained by taking the “cross-sections” of the refined space–time mesh. We estimate the computational complexity of solving systems of linear equations for multidimensional meshes with arbitrary dimensional singularities encountered in space–time formulation and time-marching schemes. The choice between space–time formulation and time-marching schemes depends entirely on the problem’s nature and the properties that need to be addressed. Thus, the paper aims to discuss the computational complexities of both approaches rather than suggest a better formulation. Our considerations concern the computational complexity of sequental execution of the multi-frontal solvers, the iterative solvers, and the static condensation. Numerical experiments with Octave confirm our theoretical findings.

Publikacje, które mogą Cię zainteresować

artykuł
Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis / Victor M. Calo, Nathaniel O. Collier, David Pardo, Maciej R. PASZYŃSKI // Procedia Computer Science [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 1877-0509. — 2011 — vol. 4 spec. iss., s. 1854–1861. — Bibliogr. s. 1861, Abstr. — W spisie treści informacja: Original Research Article. — ICCS 2011 : International Conference on Computational Science : Nanyang Technological University, Singapore, 01–03 June 2011
fragment książki
Linear computational cost galois based graph grammar direct solver for h adaptive grids / Damian Goik, Konrad Jopek, Andrew Lenharth, Donald Nguyen, Maciej PASZYŃSKI, Keshav Pingali // W: WCCM XI ; ECCM V ; ECFD VI [Dokument elektroniczny] : 11th World Congress on Computational Mechanics ; 5th European Conference on Computational Mechanics : 6th European Conference on Computational Fluid Dynamics : Barcelona, Spain, 20–25 July 2014. — Wersja do Windows. — Dane tekstowe. — [Barcelona : International Center of Numerical Methods Engineering], 2014. — e-ISBN: 978-84-942844-7-2. — S. 1–2. — Bibliogr. s. 2