G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing communication in linear algebra, SIMAX, pp.32-866, 2011.

D. W. Barron and H. P. Swinnerton-dyer, Solution of Simultaneous Linear Equations using a Magnetic-Tape Store, The Computer Journal, vol.3, issue.1, pp.28-33, 1960.
DOI : 10.1093/comjnl/3.1.28

J. W. 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, 2011.
DOI : 10.1137/080731992
URL : https://hal.archives-ouvertes.fr/hal-00870930

S. Donfack, L. Grigori, and A. Gupta, Adapting Communicationavoinding LU and QR factorizations to multicore architectures, Proceedings of the IPDPS Conference, 2010.

J. Dongarra, P. Luszczek, and A. Petitet, LINPACK Benchmark, pp.803-820, 2003.
DOI : 10.1007/978-0-387-09766-4_155

L. V. Foster, Gaussian Elimination with Partial Pivoting Can Fail in Practice, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.4, pp.1354-1362, 1994.
DOI : 10.1137/S0895479892239755

L. V. Foster, The growth factor and efficiency of Gaussian elimination with rook pivoting, Journal of Computational and Applied Mathematics, vol.86, issue.1, pp.177-194, 1997.
DOI : 10.1016/S0377-0427(97)00154-4

N. I. Gould, On Growth in Gaussian Elimination with Complete Pivoting, SIAM Journal on Matrix Analysis and Applications, vol.12, issue.2, pp.354-361, 1991.
DOI : 10.1137/0612025

L. Grigori, J. Demmel, and H. Xiang, CALU: A Communication Optimal LU Factorization Algorithm, SIAM Journal on Matrix Analysis and Applications, vol.32, issue.4, 2011.
DOI : 10.1137/100788926
URL : https://hal.archives-ouvertes.fr/hal-00651137

L. Grigori, J. W. Demmel, and H. Xiang, Communication Avoiding Gaussian elimination, 2008 SC, International Conference for High Performance Computing, Networking, Storage and Analysis, 2008.
DOI : 10.1109/SC.2008.5214287
URL : https://hal.archives-ouvertes.fr/inria-00277901

M. Gu and S. C. Eisenstat, Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization, SIAM Journal on Scientific Computing, vol.17, issue.4, pp.848-896, 1996.
DOI : 10.1137/0917055

N. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, 2002.

N. Higham and D. J. Higham, Large Growth Factors in Gaussian Elimination with Pivoting, SIMAX, pp.10-155, 1989.

J. Hong, H. T. Kung, and I. , The Red-Blue Pebble Game, STOC '81: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp.326-333, 1981.

D. Irony, S. Toledo, and A. Tiskin, Communication lower bounds for distributed-memory matrix multiplication, Journal of Parallel and Distributed Computing, vol.64, issue.9, pp.1017-1026, 2004.
DOI : 10.1016/j.jpdc.2004.03.021

R. D. Skeel, Iterative refinement implies numerical stability for Gaussian elimination, Mathematics of Computation, vol.35, issue.151, pp.817-831, 1980.
DOI : 10.1090/S0025-5718-1980-0572859-4

D. C. Sorensen, Analysis of Pairwise Pivoting in Gaussian Elimination, IEEE Transactions on Computers, vol.34, issue.3, p.274278, 1985.
DOI : 10.1109/TC.1985.1676570

L. N. Trefethen and R. S. Schreiber, Average-Case Stability of Gaussian Elimination, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.3, pp.335-360, 1990.
DOI : 10.1137/0611023

J. H. Wilkinson, Error Analysis of Direct Methods of Matrix Inversion, Journal of the ACM, vol.8, issue.3, pp.281-330, 1961.
DOI : 10.1145/321075.321076

S. J. Wright, A Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable, SIAM Journal on Scientific Computing, vol.14, issue.1, pp.231-238, 1993.
DOI : 10.1137/0914013