activity
20112023
most citedExploiting nested task-parallelism in the factorization

12 citations · 26 across the 4 of their papers we have counts for

collaborators

5 papers

cs.MS2023★ 1 cited

General framework for re-assuring numerical reliability in parallel Krylov solvers: A case of BiCGStab methods

Roman Iakymchuk, Jose I. Aliaga

Parallel implementations of Krylov subspace methods often help to accelerate the procedure of finding an approximate solution of a linear system. However, such parallelization coup…

cs.MS2020★ 3 cited

Compressed Basis GMRES on High Performance GPUs

José I. Aliaga, Hartwig Anzt, Thomas Grützmacher +2

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practic…

cs.DC2020

Reproducibility of Parallel Preconditioned Conjugate Gradient in Hybrid Programming Environments

Roman Iakymchuk, Maria Barreda, Stef Graillat +2

The Preconditioned Conjugate Gradient method is often employed for the solution of linear systems of equations arising in numerical simulations of physical phenomena. While being w…

cs.MS2019★ 12 cited

Exploiting nested task-parallelism in the factorization

Rocío Carratalá-Sáez, Sven Christophersen, José I. Aliaga +3

We address the parallelization of the LU factorization of hierarchical matrices (-matrices) arising from boundary element methods. Our approach exploits task-paralleli…

cs.PF2011★ 10 cited

Solving Dense Generalized Eigenproblems on Multi-threaded Architectures

José I. Aliaga, Paolo Bientinesi, Davor Davidović +3

We compare two approaches to compute a portion of the spectrum of dense symmetric definite generalized eigenproblems: one is based on the reduction to tridiagonal form, and the oth…