E. Agullo, L. Giraud, and Y. Jing, Block GMRES Method with Inexact Breakdowns and Deflated Restarting, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.4, pp.1625-1651, 2014.
DOI : 10.1137/140961912
URL : https://hal.archives-ouvertes.fr/hal-00963704

S. F. Ashby, T. A. Manteuffel, and P. E. Saylor, A Taxonomy for Conjugate Gradient Methods, SIAM Journal on Numerical Analysis, vol.27, issue.6, pp.1542-1568, 1990.
DOI : 10.1137/0727091

S. Balay, S. Abhyankar, M. F. Adams, J. Brown, P. Brune et al., PETSc users manual, 2017.

H. Calandra, S. Gratton, R. Lago, X. Vasseurm, and L. M. Carvalho, A Modified Block Flexible GMRES Method with Deflation at Each Iteration for the Solution of Non-Hermitian Linear Systems with Multiple Right-Hand Sides, SIAM Journal on Scientific Computing, vol.35, issue.5, pp.345-367, 2013.
DOI : 10.1137/120883037
URL : https://hal.archives-ouvertes.fr/hal-01332933

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

J. Chen, A deflated version of the block conjugate gradient algorithm with an application to gaussian process maximum likelihood estimation, 2011.

A. T. , Chronopoulos. s-step iterative methods for (non)symmetric (in)definite linear systems, SIAM Journal on Numerical Analysis, vol.28, issue.6, pp.1776-1789, 1991.

T. A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-125, 2011.
DOI : 10.1145/2049662.2049663

J. Demmel, L. Grigori, M. Hoemmen, and J. Langou, Communication-optimal Parallel and Sequential QR and LU Factorizations, SIAM Journal on Scientific Computing, vol.34, issue.1, pp.206-239, 2012.
DOI : 10.1137/080731992
URL : https://hal.archives-ouvertes.fr/hal-00870930

J. Demmel, M. Hoemmen, M. Mohiyuddin, and K. Yelick, Minimizing communication in sparse matrix solvers, Proceedings of the ACM/IEEE Supercomputing SC9 Conference, 2009.

J. W. Demmel, L. Grigori, M. Gu, and H. Xiang, Communication Avoiding Rank Revealing QR Factorization with Column Pivoting, SIAM Journal on Matrix Analysis and Applications, vol.36, issue.1, pp.55-89, 2015.
DOI : 10.1137/13092157X
URL : https://hal.archives-ouvertes.fr/hal-01112914

V. Dolean, P. Jolivet, and F. Nataf, An introduction to domain decomposition methods, Algorithms, theory, and parallel implementation, 2015.
DOI : 10.1137/1.9781611974065
URL : https://hal.archives-ouvertes.fr/cel-01100932

Z. , Conjugate gradient method with preconditioning by projector, International Journal of Computer Mathematics, vol.49, issue.3-4, pp.315-323, 1988.
DOI : 10.1016/0024-3795(80)90245-1

A. A. Dubrulle, Retooling the method of block conjugate gradients, ETNA. Electronic Transactions on Numerical Analysis [electronic only], vol.12, pp.216-233, 2001.

A. Guennouni, K. Jbilou, and H. Sadok, A block version of bicgstab for linear systems with multiple right-hand sides, ETNA. Electronic Transactions on Numerical Analysis [electronic only], vol.16, pp.129-142, 2003.

P. Ghysels and W. Vanroose, Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm, 7th Workshop on Parallel Matrix Algorithms and Applications, pp.224-238, 2014.
DOI : 10.1016/j.parco.2013.06.001

L. Grigori, S. Moufawad, and F. Nataf, Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication, SIAM Journal on Matrix Analysis and Applications, vol.37, issue.2, pp.744-773, 2016.
DOI : 10.1137/140989492
URL : https://hal.archives-ouvertes.fr/hal-01065985

L. Grigori, F. Nataf, and Y. Soleiman, Robust algebraic Schur complement preconditioners based on low rank corrections, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01017448

L. Grigori and O. Tissot, Reducing the communication and computational costs of enlarged krylov subspaces conjugate gradient, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01451199

M. H. Gutknecht, Block Krylov space methods for linear systems with multiple right-hand sides: an introduction. in: Modern Mathematical Models, Methods and Algorithms for Real World Systems, pp.420-447, 2007.

F. Hecht, New development in freefem++, Journal of Numerical Mathematics, vol.20, issue.3-4, pp.251-265, 2012.
DOI : 10.1515/jnum-2012-0013
URL : https://hal.archives-ouvertes.fr/hal-01476313

M. R. 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

M. Hoemmen, Communication-avoiding Krylov subspace methods, 2010.

A. Kalhan, J. Dongarra, and V. Eijkhout, Reverse communication interface for linear algebra templates for iterative methods, 1995.

H. Ji and Y. Li, A breakdown-free block conjugate gradient method, BIT Numerical Mathematics, vol.236, issue.6, pp.379-403, 2017.
DOI : 10.1016/j.cam.2011.09.020

P. Jolivet, F. Hecht, F. Nataf, and C. Prudhomme, Scalable domain decomposition preconditioners for heterogeneous elliptic problems, Proceedings of the 2013 International Conference on High Performance Computing, pp.1-8011, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00939957

P. Jolivet and P. Tournier, Block Iterative Methods and Recycling for Improved Scalability of Linear Solvers, SC16: International Conference for High Performance Computing, Networking, Storage and Analysis, pp.1-17, 2016.
DOI : 10.1109/SC.2016.16
URL : https://hal.archives-ouvertes.fr/hal-01357998

P. Jolivet, Domain decomposition methods Application to highperformance computing. Theses, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01155718

G. Karypis and V. Kumar, Metis ? unstructured graph partitioning and sparse matrix ordering system, version 2.0, 1995.

M. Kreutzer, J. Thies, M. Röhrig-zöllner, A. Pieper, F. Shahzad et al., GHOST: Building Blocks for High Performance Sparse Linear Algebra on Heterogeneous Systems, International Journal of Parallel Programming, vol.52, issue.4, pp.451046-1072, 2017.
DOI : 10.1145/1498765.1498785

J. Langou, Iterative methods for solving linear systems with multiple righthand sides, CERFACS, 2003.

D. P. Leary, The block conjugate gradient algorithm and related methods, Linear Algebra and its Applications, vol.29, pp.293-322, 1980.
DOI : 10.1016/0024-3795(80)90247-5

M. Robbé and M. Sadkane, Exact and inexact breakdowns in the block GMRES method, Linear Algebra and its Applications, vol.419, issue.1, pp.265-285, 2006.
DOI : 10.1016/j.laa.2006.04.018

Y. Saad, Iterative methods for sparse linear systems, SIAM, 2003.
DOI : 10.1137/1.9780898718003

N. Spillane, Adaptive Multi Preconditioned Conjugate Gradient: Algorithm , Theory and an Application to Domain Decomposition. preprint, 2015.

N. Spillane, An Adaptive MultiPreconditioned Conjugate Gradient Algorithm, SIAM Journal on Scientific Computing, vol.38, issue.3, pp.1896-1918, 2016.
DOI : 10.1137/15M1028534
URL : https://hal.archives-ouvertes.fr/hal-01170059

N. Spillane, V. Dolean, P. Hauret, F. Nataf, C. Pechstein et al., Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps, Numerische Mathematik, vol.349, issue.23???24, pp.741-770, 2014.
DOI : 10.1016/j.crma.2011.10.021
URL : https://hal.archives-ouvertes.fr/hal-01405538

R. Thakur, R. Rabenseifner, and W. Gropp, Optimization of Collective Communication Operations in MPICH, The International Journal of High Performance Computing Applications, vol.19, issue.1, pp.49-66, 2005.
DOI : 10.1007/3-540-45825-5_43

E. Wang, Q. Zhang, B. Shen, G. Zhang, X. Lu et al., Intel Math Kernel Library, High-Performance Computing on the Intel® Xeon Phi, pp.167-188, 2014.
DOI : 10.1007/978-3-319-06486-4_7

I. Yamazaki, S. Tomov, and J. Dongarra, Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs, SIAM Journal on Scientific Computing, vol.37, issue.3, pp.307-330, 2015.
DOI : 10.1137/14M0973773