Y. Achdou and F. Nataf, Low frequency tangential filtering decomposition, Numerical Linear Algebra with Applications, vol.14, pp.129-147, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00194096

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, pp.1625-1651, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00963704

H. , A. Daas, and L. Grigori, A class of efficient locally constructed preconditioners based on coarse spaces
URL : https://hal.archives-ouvertes.fr/hal-01963067

L. Lions, , 2018.

H. Daas, L. Grigori, P. Hénon, and P. Ricoux, Enlarged GMRES for reducing communication, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01497943

H. Daas, L. Grigori, P. Hénon, and P. Ricoux, Enlarged GMRES for solving linear systems with one or multiple right-hand sides, IMA Journal of Numerical Analysis, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01963032

H. Daas, L. Grigori, P. Hénon, and P. Ricoux, Recycling Krylov subspaces and reducing deflation subspaces for solving sequence of linear systems, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01886546

W. E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quarterly of Applied Mathematics, vol.9, issue.1, pp.17-29, 1951.
URL : https://hal.archives-ouvertes.fr/hal-01712943

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing Communication in Linear Algebra, 2009.

R. Bridson and C. Greif, A Multipreconditioned Conjugate Gradient Algorithm, SIAM Journal on Matrix Analysis and Applications, vol.27, pp.1056-1068, 2006.
DOI : 10.1137/040620047
URL : http://www.cs.ubc.ca/~rbridson/mpcg/bridsongreif-2005-multipcg.pdf

H. Calandra, S. Gratton, R. Lago, X. Vasseur, 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, pp.345-367, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01332933

H. Cao, DEVELOPMENT OF TECHNIQUES FOR GENERAL PURPOSE SIMUL ATORS, 2002.

T. F. Chan, Rank revealing QR factorizations, Linear Algebra and its Applications, vol.88, pp.67-82, 1987.

T. F. Chan and T. P. Mathew, Domain decomposition algorithms, Acta Numerica, vol.3, pp.61-143, 1994.

M. A. Christie and M. J. Blunt, Tenth SPE Comparative Solution Project: A Comparison of Upscaling Techniques, 2001.

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

N. R. Council-;-s, M. Graham, C. A. Snir, and . Patterson, Getting Up to Speed: The Future of Supercomputing, 2005.

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

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

J. Dongarra, V. Eijkhout, and A. Kalhan, Reverse Communication Interface for Linear Algebra Templates for Iterative Methods, 1995.

J. Erhel, K. Burrage, and B. Pohl, Restarted GMRES preconditioned by deflation, Journal of Computational and Applied Mathematics, vol.69, pp.303-318, 1996.
DOI : 10.1016/0377-0427(95)00047-x
URL : https://doi.org/10.1016/0377-0427(95)00047-x

V. Faber and T. Manteuffel, Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method, SIAM Journal on Numerical Analysis, vol.21, pp.352-362, 1984.

R. W. Freund and M. Malhotra, A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides, Linear Algebra and its Applications, vol.254, pp.119-157, 1997.
DOI : 10.1016/s0024-3795(96)00529-0
URL : https://doi.org/10.1016/s0024-3795(96)00529-0

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, pp.48-71, 2013.

P. Ghysels and W. Vanroose, Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm, 7th Workshop on Parallel Matrix Algorithms and Applications, vol.40, pp.224-238, 2014.

L. Giraud, J. Langou, and M. Rozloznik, The loss of orthogonality in the GramSchmidt orthogonalization process, Computers & Mathematics with Applications, vol.50, pp.1069-1075, 2005.

G. H. Golub and C. F. Van-loan, Matrix Computations, 1996.

C. Greif, T. Rees, and D. B. Szyld, MPGMRES: a generalized minimum residual method with multiple preconditioners, In: SIAM Journal on Scientific Computing, vol.14, pp.461-469, 1993.

M. Griebel and P. Oswald, On the abstract theory of additive and multiplicativeSchwarz algorithms, Numerische Mathematik, vol.70, pp.163-180, 1995.

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, pp.744-773, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01065985

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

T. Gu, X. Liu, Z. Mo, and X. Chi, Multiple search direction conjugate gradient method I: methods and their propositions, International Journal of Computer Mathematics, vol.81, pp.1133-1143, 2004.

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, vol.16, pp.129-142, 2003.

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++, J. Numer. Math, vol.20, issue.3-4, pp.251-265, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01476313

M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, In: Journal of research of the National Bureau of Standards, vol.49, pp.409-436, 1952.

M. Hoemmen, Communication-Avoiding Krylov Subspace Methods, 2010.

G. Ifrah, The Universal History of Computing: From the Abacus to Quantum Computing, 2000.

, Math Kernel Library

D. Irony, S. Toledo, and A. Tiskin, Communication lower bounds for distributedmemory matrix multiplication, Journal of Parallel and Distributed Computing, vol.64, pp.1017-1026, 2004.

X. , Theory of Multilevel Methods, 1989.

H. Jia-wei and H. T. Kung, I/O Complexity: The Red-blue Pebble Game, Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing. STOC '81, pp.326-333, 1981.

G. Karypis and V. Kumar, Multilevelk-way Partitioning Scheme for Irregular Graphs, Journal of Parallel and Distributed Computing, vol.48, pp.96-129, 1998.

J. Langou, Iterative methods for solving linear systems with multiple right-hand sides, 2003.

R. Li and Y. Saad, Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners, SIAM Journal on Matrix Analysis and Applications, vol.38, pp.807-828, 2017.

T. Y. Li and Z. Zeng, A Rank-Revealing Method with Updating, Downdating, and Applications, In: SIAM Journal on Matrix Analysis and Applications, vol.26, pp.918-946, 2005.

T. A. , On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265

R. B. Morgan, A Restarted GMRES Method Augmented with Eigenvectors, SIAM Journal on Matrix Analysis and Applications, vol.16, pp.1154-1171, 1995.

R. B. Morgan, GMRES with Deflated Restarting, SIAM Journal on Scientific Computing, vol.24, pp.20-37, 2002.

R. B. Morgan, Restarted block-GMRES with Deflation of Eigenvalues, Appl. Numer. Math, vol.54, issue.2, pp.222-236, 2005.

F. Nataf, F. Hecht, P. Jolivet, and C. Prud'homme, Scalable Domain Decomposition Preconditioners For Heterogeneous Elliptic Problems, p.13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00939957

F. Nataf, H. Xiang, V. Dolean, and N. Spillane, A Coarse Space Construction Based on Local Dirichlet-to-Neumann Maps, SIAM Journal on Scientific Computing, vol.33, pp.1623-1642, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00491919

S. V. Nepomnyaschikh, Decomposition And Fictitious Domains Methods For Elliptic Boundary Value Problems, 1992.

S. V. Nepomnyaschikh, Mesh theorems of traces, normalizations of function traces and their inversions, Sov. J. Numer. Anal. Math. Modeling, vol.6, pp.1-25, 1991.

A. A. Nikishin and A. Y. Yeremin, Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme, SIAM Journal on Matrix Analysis and Applications, vol.16, pp.1135-1153, 1995.

Q. Niu, L. Grigori, P. Kumar, and F. Nataf, Modified tangential frequency filtering decomposition and its fourier analysis, Numerische Mathematik, vol.116, pp.123-148, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00324378

D. P. O'leary, The block conjugate gradient algorithm and related methods, Linear Algebra and its Applications, vol.29, pp.293-322, 1980.

M. L. Parks, E. De-sturler, G. Mackey, D. D. Johnson, and S. Maiti, Recycling Krylov Subspaces for Sequences of Linear Systems, SIAM Journal on Scientific Computing, vol.28, issue.5, pp.1651-1674, 2006.

M. L. Parks, THE ITERATIVE SOLUTION OF A SEQUENCE OF LINEAR SYSTEMS ARISING FROM NONLINEAR FINITE ELEMENT ANALYSIS, 2005.

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.

Y. Saad, Iterative Methods for Sparse Linear Systems. 2nd, 2003.

Y. Saad and M. H. Schultz, GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.3, pp.856-869, 1986.

Y. Saad, A flexible inner-outer preconditioned GMRES algorithm, In: SIAM Journal on Scientific Computing, vol.14, pp.461-469, 1993.

H. C. Schlumberger, H. T. , J. W. Inc, and H. Y. Chevron, Parallel Scalable Unstructured CPR-Type Linear Solver for Resevoir Simulation, 2005.

R. Schreiber and B. Parlett, Block Reflectors: Theory and Computation, In: SIAM Journal on Numerical Analysis, vol.25, pp.189-205, 1988.

V. Simoncini, On the Convergence of Restarted Krylov Subspace Methods, SIAM Journal on Matrix Analysis and Applications, vol.22, pp.430-452, 2000.

V. Simoncini and E. Gallopoulos, Convergence properties of block GMRES and matrix polynomials, Linear Algebra and its Applications, vol.247, pp.97-119, 1996.

M. Snir, S. Otto, S. Huss-lederman, D. Walker, and J. Dongarra, MPI-The Complete Reference, The MPI Core. 2nd. (Revised), vol.1, 1998.

P. Sonneveld, CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems, In: SIAM Journal on Scientific and Statistical Computing, vol.10, pp.36-52, 1989.

N. Spillane, An Adaptive MultiPreconditioned Conjugate Gradient Algorithm, SIAM Journal on Scientific Computing, vol.38, pp.1896-1918, 2016.
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.126, pp.741-770, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01405538

N. Spillane and D. Rixen, Automatic spectral coarse spaces for robust finite element tearing and interconnecting and balanced domain decomposition algorithms, International Journal for Numerical Methods in Engineering, vol.95, issue.11, pp.953-990

A. Stathopoulos and K. Wu, A Block Orthogonalization Procedure with Constant Synchronization Requirements, SIAM Journal on Scientific Computing, vol.23, pp.2165-2182, 2002.

G. W. Stewart, A Krylov-Schur Algorithm for Large Eigenproblems, SIAM Journal on Matrix Analysis and Applications, vol.23, pp.601-614, 2002.

G. W. Stewart, Updating a Rank-Revealing ULV Decomposition, SIAM Journal on Matrix Analysis and Applications, vol.14, pp.494-499, 1993.

F. Sullivan and J. Dongarra, Guest Editors' Introduction: The Top 10 Algorithms, Computing in Science & Engineering, vol.2, pp.22-23, 2000.

J. M. Tang, R. Nabben, C. Vuik, and Y. A. Erlangga, Comparison of Two-Level Preconditioners Derived from Deflation, Domain Decomposition and Multigrid Methods, Journal of Scientific Computing, vol.39, pp.340-370, 2009.

A. Toselli and O. Widlund, Domain Decomposition Methods-Algorithms and Theory, 2005.

B. Vital, Étude de quelques méthodes de résolution de problèmes lineaires de grande taille sur multiprocesseur, 1990.

H. A. Van-der and . Vorst, Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, vol.13, pp.631-644, 1992.

J. Wallis, R. Kendall, and T. Little, Constrained Residual Acceleration of Conjugate Residual Methods, SPE 13563, 1985.