[图书][B] Fast solvers for mesh-based computations
M Paszynski - 2016 - books.google.com
Based on more than 10 years of the author's experience in the area, this book targets
researchers and graduate students who would like to learn how to design and implement …
researchers and graduate students who would like to learn how to design and implement …
Porting HPC applications to the cloud: A multi-frontal solver case study
In this paper we argue that scientific applications traditionally considered as representing
typical HPC workloads can be successfully and efficiently ported to a cloud infrastructure …
typical HPC workloads can be successfully and efficiently ported to a cloud infrastructure …
Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines
This paper derives theoretical estimates of the computational cost for isogeometric multi-
frontal direct solver executed on parallel distributed memory machines. We show …
frontal direct solver executed on parallel distributed memory machines. We show …
Complexity of direct and iterative solvers on space–time formulations and time-marching schemes for h-refined grids towards singularities
M Skotniczny, A Paszyńska, S Rojas… - Journal of Computational …, 2024 - Elsevier
We study computational complexity aspects for Finite Element formulations considering
hypercubic space–time full and time-marching discretization schemes for h-refined grids …
hypercubic space–time full and time-marching discretization schemes for h-refined grids …
[HTML][HTML] A study of concurrent multi-frontal solvers for modern massively parallel architectures
Abstract Leveraging Trace Theory, we investigate the efficient parallelization of direct
solvers for large linear equation systems. Our focus lies on a multi-frontal algorithm, and we …
solvers for large linear equation systems. Our focus lies on a multi-frontal algorithm, and we …
Computational complexity of hierarchically adapted meshes
M Skotniczny - International Conference on Computational Science, 2020 - Springer
We show that for meshes hierarchically adapted towards singularities there exists an order
of variable elimination for direct solvers that will result in time complexity not worse than O …
of variable elimination for direct solvers that will result in time complexity not worse than O …
Complexity of direct and iterative solvers on space-time formulations versus time--marching schemes for h-refined grids towards singularities
M Skotniczny, A Paszynska, S Rojas… - arXiv preprint arXiv …, 2021 - arxiv.org
We study computational complexity aspects for Finite Element formulations considering
hypercubic space--time full and time--marching discretization schemes for $ h $--refined …
hypercubic space--time full and time--marching discretization schemes for $ h $--refined …
Leveraging workflows and clouds for a multi-frontal solver for finite element meshes
Scientific workflows in clouds have been successfully used for automation of large-scale
computations, but so far they were applied to the loosely-coupled problems, where most …
computations, but so far they were applied to the loosely-coupled problems, where most …
Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids
Abstract The hp-adaptive Finite Element Method (hp-FEM) generates a sequence of
adaptive grids with different polynomial orders of approximation and element sizes. The hp …
adaptive grids with different polynomial orders of approximation and element sizes. The hp …
Hybrid direct and iterative solver with library of multi-criteria optimal orderings for h adaptive finite element method computations
H AbouEisha, K Jopek, B Medygrał, M Moshkov… - Procedia Computer …, 2016 - Elsevier
In this paper we present a multi-criteria optimization of element partition trees and resulting
orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite …
orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite …