most citedComplexity of direct and iterative solvers on space-time formulations versus time--marching schemes for h-refined grids towards singularities

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

math.NA2021★ 1 cited

Complexity of direct and iterative solvers on space-time formulations versus time--marching schemes for h-refined grids towards singularities

Marcin Skotniczny, Anna Paszynska, Sergio Rojas +1

We study computational complexity aspects for Finite Element formulations considering hypercubic space--time full and time--marching discretization schemes for --refined grids t…