R. Barrett, M. Berry, T. Chan, J. Demmel, J. Donato et al., Van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 1994.

E. Carson and J. Demmel, A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.1, pp.22-43, 2014.
DOI : 10.1137/120893057

E. Carson, N. Knight, and J. Demmel, Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods, SIAM Journal on Scientific Computing, vol.35, issue.5, pp.42-61, 2013.
DOI : 10.1137/120881191

E. Carson, M. Rozlozník, Z. Strako?, and P. , Tich`Tich`y, and M. T?ma, On the numerical stability analysis of pipelined Krylov subspace methods, SIAM J. Sci. Comput

A. Chronopoulos and C. , s-step iterative methods for symmetric linear systems, Journal of Computational and Applied Mathematics, vol.25, issue.2, pp.153-168, 1989.
DOI : 10.1016/0377-0427(89)90045-9
URL : https://doi.org/10.1016/0377-0427(89)90045-9

A. Chronopoulos and A. Kucherov, Block s-step Krylov iterative methods, Numerical Linear Algebra with Applications, vol.11, issue.2, pp.3-15, 2010.
DOI : 10.1137/1.9780898719611

A. Chronopoulos and C. Swanson, Parallel iterative S-step methods for unsymmetric linear systems, Parallel Computing, vol.22, issue.5, pp.623-641, 1996.
DOI : 10.1016/0167-8191(96)00022-1

E. D. Azevedo, V. Eijkhout, and C. Romine, Reducing Communication Costs in the Conjugate Gradient Algorithm on Distributed Memory Multiprocessors, 1992.
DOI : 10.2172/10176473

E. De-sturler, A parallel variant of GMRES(m), Proceedings of the 13th IMACS World Congress on Computational and Applied Mathematics, pp.682-683, 1991.

D. Sturler, H. Van, and . Vorst, Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers, Applied Numerical Mathematics, vol.18, issue.4, pp.441-459, 1995.
DOI : 10.1016/0168-9274(95)00079-A

J. Demmel, M. Heath, and H. , Parallel numerical linear algebra, Acta Numerica, vol.10, pp.111-197, 1993.
DOI : 10.1007/BF01932738
URL : http://www.nsm.buffalo.edu/courses/mth667/cor501f03/LAPACnote.pdf

J. Dongarra, P. Beckman, T. Moore, P. Aerts, G. Aloisio et al., The International Exascale Software Project roadmap, The International Journal of High Performance Computing Applications, vol.25, issue.1, pp.25-28, 2011.
DOI : 10.1088/1742-6596/180/1/012045
URL : http://www.exascale.org/mediawiki/images/2/20/IESP-roadmap.pdf

J. Dongarra, I. Duff, D. Sorensen, and H. , Van der Vorst, Numerical Linear Algebra for High-Performance Computers, 1998.
DOI : 10.1137/1.9780898719611

J. Dongarra and M. Heroux, Toward a New Metric for Ranking High Performance Computing Systems, 2013.

J. Dongarra, M. Heroux, P. Luszczek, and . Benchmark, A new metric for ranking high-performance computing systems, National Science Review, vol.9, issue.1, 2015.
DOI : 10.1137/1.9780898718003
URL : https://academic.oup.com/nsr/article-pdf/3/1/30/7433907/nwv084.pdf

P. Eller and W. Gropp, Scalable Non-blocking Preconditioned Conjugate Gradient Methods, SC16: International Conference for High Performance Computing, Networking, Storage and Analysis, pp.204-215, 2016.
DOI : 10.1109/SC.2016.17

T. Gergelits and Z. Strako?, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, Numerical Algorithms, vol.32, issue.156, pp.759-782, 2014.
DOI : 10.1002/sapm1953321243

P. Ghysels, T. Ashby, K. Meerbergen, and W. Vanroose, Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines, SIAM Journal on Scientific Computing, vol.35, issue.1, pp.48-71, 2013.
DOI : 10.1137/12086563X

P. Ghysels and W. Vanroose, Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm, Parallel Computing, vol.40, issue.7, pp.224-238, 2014.
DOI : 10.1016/j.parco.2013.06.001

A. Greenbaum, Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences, Linear Algebra and its Applications, vol.113, pp.7-63, 1989.
DOI : 10.1016/0024-3795(89)90285-1

A. Greenbaum, Estimating the Attainable Accuracy of Recursively Computed Residual Methods, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.3, pp.535-551, 1997.
DOI : 10.1137/S0895479895284944

A. Greenbaum, Iterative Methods for Solving Linear Systems, 1997.
DOI : 10.1137/1.9781611970937

A. Greenbaum and Z. Strako?, Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations, SIAM Journal on Matrix Analysis and Applications, vol.13, issue.1, pp.121-137, 1992.
DOI : 10.1137/0613011

M. Gutknecht and Z. Strako?, Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.1, pp.213-229, 2000.
DOI : 10.1137/S0895479897331862

N. Halko, P. Martinsson, and J. Tropp, Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions, SIAM Review, vol.53, issue.2, pp.217-288, 2011.
DOI : 10.1137/090771806
URL : http://www.acm.caltech.edu/%7Ejtropp/papers/HMT10-Finding-Structure-preprint.pdf

M. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards, vol.49, issue.6, pp.409-436, 1952.
DOI : 10.6028/jres.049.044

N. Higham, Accuracy and Stability of Numerical Algorithms, 2002.
DOI : 10.1137/1.9780898718027

J. Liesen and Z. Strako?, Krylov Subspace Methods: Principles and Analysis
DOI : 10.1093/acprof:oso/9780199655410.001.0001

G. Meurant, Computer Solution of Large Linear Systems, 1999.

G. Meurant and Z. Strako?, The Lanczos and conjugate gradient algorithms in finite precision arithmetic, Acta Numerica, vol.15, pp.471-542, 2006.
DOI : 10.1017/S096249290626001X

Y. Notay, On the convergence rate of the conjugate gradients in presence of rounding errors, Numerische Mathematik, vol.48, issue.156, pp.301-317, 1993.
DOI : 10.1007/BF01385754

C. Paige, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, 1971.

C. Paige, Computational Variants of the Lanczos Method for the Eigenproblem, IMA Journal of Applied Mathematics, vol.10, issue.3, pp.373-381, 1972.
DOI : 10.1093/imamat/10.3.373

C. Paige, Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix, IMA Journal of Applied Mathematics, vol.18, issue.3, pp.341-349, 1976.
DOI : 10.1093/imamat/18.3.341

C. Paige, Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem, Linear Algebra and its Applications, vol.34, pp.235-258, 1980.
DOI : 10.1016/0024-3795(80)90167-6

Y. Saad, Iterative Methods for Sparse Linear Systems, 2003.
DOI : 10.1137/1.9780898718003

G. Sleijpen, H. Van, and . Vorst, Zuverl????lich berechnete Residuen in hybriden Bi-CG Verfahren, Computing, vol.15, issue.2, pp.56-141, 1996.
DOI : 10.6028/jres.049.006

G. Sleijpen and H. , BiCGstab(l) and other hybrid Bi-CG methods, Numerical Algorithms, vol.15, issue.1, pp.75-109, 1994.
DOI : 10.1137/0613050
URL : http://www.math.ruu.nl/people/sleijpen/Reprints/SVF94.pdf

G. Sleijpen, H. Van-der, J. Vorst, and . Modersitzki, Differences in the Effects of Rounding Errors in Krylov Solvers for Symmetric Indefinite Linear Systems, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.3, pp.726-751, 2001.
DOI : 10.1137/S0895479897323087

E. Stiefel, Relaxationsmethoden bester Strategie zur L??sung linearer Gleichungssysteme, Commentarii Mathematici Helvetici, vol.29, issue.1, pp.157-179, 1955.
DOI : 10.1007/BF02564277

Z. Strako?, Effectivity and optimizing of algorithms and programs on the host-computer/array-processor system, Parallel Computing, vol.4, issue.2, pp.189-207, 1987.
DOI : 10.1016/0167-8191(87)90051-2

Z. Strako? and P. Tich, Tich`y, On error estimation in the Conjugate Gradient method and why it works in finite precision computations, Electron. Trans. Numer. Anal, vol.13, pp.56-80, 2002.

Z. Strako? and P. Tich, Error Estimation in Preconditioned Conjugate Gradients, BIT Numerical Mathematics, vol.45, issue.4, pp.789-817, 2005.
DOI : 10.1007/s10543-005-0032-1

C. Tong and Q. Ye, Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems, Mathematics of Computation, vol.69, issue.232, pp.1559-1575, 2000.
DOI : 10.1090/S0025-5718-99-01171-0

H. Van-der-vorst and Q. Ye, Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals, SIAM Journal on Scientific Computing, vol.22, issue.3, pp.835-852, 2000.
DOI : 10.1137/S1064827599353865

J. Wilkinson, Rounding Errors in Algebraic Processes, Courier Corporation, 1994.