default search action
Roman Iakymchuk
Person information
- affiliation: Uppsala University, Sweden
- affiliation: Umeå University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Roman Iakymchuk
, Stef Graillat, José Ignacio Aliaga
General framework for re-assuring numerical reliability in parallel Krylov solvers: A case of bi-conjugate gradient stabilized methods. Int. J. High Perform. Comput. Appl. 38(1): 17-33 (2024) - [c14]Mykhailo Havdiak, José Ignacio Aliaga, Roman Iakymchuk:
Robustness and Accuracy in Pipelined Bi-conjugate Gradient Stabilized Methods. ICCS (3) 2024: 311-319 - [i7]Mykhailo Havdiak, Jose I. Aliaga, Roman Iakymchuk:
Robustness and Accuracy in Pipelined Bi-Conjugate Gradient Stabilized Method: A Comparative Study. CoRR abs/2404.13216 (2024) - [i6]Yanxiang Chen, Pablo de Oliveira Castro, Paolo Bientinesi, Roman Iakymchuk:
Enabling mixed-precision with the help of tools: A Nekbone case study. CoRR abs/2405.11065 (2024) - [i5]Aurélien Delval, François Coppens, Eric Petit, Roman Iakymchuk, Pablo de Oliveira Castro:
Verificarlo CI: continuous integration for numerical optimization and debugging. CoRR abs/2407.08262 (2024) - 2023
- [i4]Roman Iakymchuk, José Ignacio Aliaga:
General framework for re-assuring numerical reliability in parallel Krylov solvers: A case of BiCGStab methods. CoRR abs/2302.04180 (2023) - 2022
- [c13]Roman Iakymchuk
General Framework for Deriving Reproducible Krylov Subspace Algorithms: BiCGStab Case. PPAM (1) 2022: 16-29 - [i3]Roman Iakymchuk, Amândio Faustino, Andrew P. J. Emerson, João Barreto, Valeria Bartsch, Rodrigo Rodrigues, José C. Monteiro:
Efficient and Eventually Consistent Collective Operations. CoRR abs/2203.17063 (2022) - 2021
- [j10]Ioannis K. Argyros, Stepan Shakhno
Gauss-Newton-Secant Method for Solving Nonlinear Least Squares Problems under Generalized Lipschitz Conditions. Axioms 10(3): 158 (2021) - [c12]Daichi Mukunoki
Conjugate Gradient Solvers with High Accuracy and Bit-wise Reproducibility between CPU and GPU using Ozaki scheme. HPC Asia 2021: 100-109 - [c11]Roman Iakymchuk, Amândio Faustino, Andrew P. J. Emerson
Efficient and Eventually Consistent Collective Operations. IPDPS Workshops 2021: 621-630 - 2020
- [j9]Fearghal O'Donncha
AllScale toolchain pilot applications: PDE based solvers using a parallel development environment. Comput. Phys. Commun. 251: 107089 (2020) - [j8]Roman Iakymchuk, María Barreda Vayá, Stef Graillat, José Ignacio Aliaga
Reproducibility of parallel preconditioned conjugate gradient in hybrid programming environments. Int. J. High Perform. Comput. Appl. 34(5) (2020) - [j7]Roman Iakymchuk
Reproducibility strategies for parallel Preconditioned Conjugate Gradient. J. Comput. Appl. Math. 371: 112697 (2020) - [c10]Fabienne Jézéquel, Stef Graillat, Daichi Mukunoki
Can We Avoid Rounding-Error Estimation in HPC Codes and Still Get Trustworthy Results? VSTTE 2020: 163-177 - [i2]Roman Iakymchuk
White Paper from Workshop on Large-scale Parallel Numerical Computing Technology (LSPANC 2020): HPC and Computer Arithmetic toward Minimal-Precision Computing. CoRR abs/2004.04628 (2020) - [i1]Roman Iakymchuk
Reproducibility of Parallel Preconditioned Conjugate Gradient in Hybrid Programming Environments. CoRR abs/2005.07282 (2020)
2010 – 2019
- 2019
- [j6]Matthias Wiesenberger
Reproducibility, accuracy and performance of the Feltor code and library on parallel computer architectures. Comput. Phys. Commun. 238: 145-156 (2019) - [j5]Christian Simmendinger
Interoperability strategies for GASPI and MPI in large-scale scientific applications. Int. J. High Perform. Comput. Appl. 33(3) (2019) - [j4]Roman Iakymchuk
Hierarchical approach for deriving a reproducible unblocked LU factorization. Int. J. High Perform. Comput. Appl. 33(5) (2019) - 2018
- [j3]Peter Thoman, Kiril Dichev
A taxonomy of task-based parallel programming technologies for high-performance computing. J. Supercomput. 74(4): 1422-1434 (2018) - [c9]Muhammed Abdullah Al Ahad, Christian Simmendinger
Efficient Algorithms for Collective Operations with Notified Communication in Shared Windows. PAW-ATM@SC 2018: 1-10 - 2017
- [c8]Dana Akhmetova, Roman Iakymchuk
Performance Study of Multithreaded MPI and OpenMP Tasking in a Large Scientific Code. IPDPS Workshops 2017: 756-765 - [c7]Roman Iakymchuk
Towards Reproducible Blocked LU Factorization. IPDPS Workshops 2017: 1598-1607 - [c6]Peter Thoman, Khalid Hasanov, Kiril Dichev, Roman Iakymchuk
A Taxonomy of Task-Based Technologies for High-Performance Computing. PPAM (2) 2017: 264-274 - [c5]Dana Akhmetova, Luis Cebamanos
Interoperability of GASPI and MPI in Large Scale Scientific Applications. PPAM (2) 2017: 277-287 - 2016
- [c4]Stefano Markidis, Ivy Bo Peng
A Performance Characterization of Streaming Computing on Supercomputers. ICCS 2016: 98-107 - 2015
- [j2]Caroline Collange, David Defour, Stef Graillat, Roman Iakymchuk
Numerical reproducibility for the parallel reduction on multi- and many-core architectures. Parallel Comput. 49: 83-97 (2015) - [c3]Roman Iakymchuk
Reproducible Triangular Solvers for High-Performance Computing. ITNG 2015: 353-358 - 2014
- [c2]Roman Iakymchuk
Reproducible and Accurate Matrix Multiplication. SCAN 2014: 126-137 - 2012
- [b1]Roman Iakymchuk:
Performance modeling and prediction for linear algebra algorithms. RWTH Aachen University, 2012, pp. 1-117 - [j1]Roman Iakymchuk, Paolo Bientinesi:
Modeling performance through memory-stalls. SIGMETRICS Perform. Evaluation Rev. 40(2): 86-91 (2012) - 2011
- [c1]Roman Iakymchuk
Improving high-performance computations on clouds through resource underutilization. SAC 2011: 119-126 - 2010
- [p1]Paolo Bientinesi, Roman Iakymchuk, Jeff Napper:
HPC on Competitive Cloud Resources. Handbook of Cloud Computing 2010: 493-516
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: