Memory footprint Deep learning Block low-rank compression Heterogeneous architecture Aetiological lithiasis Task-based programming Absorbing Boundary Conditions Memory Contention Adaptation de maillage Sparse direct solvers Algorithms Numerical detection Predictive Models OpenMP Cutting and Packing Dense linear algebra Task graph BEM Level-set Fast multipole method Cholesky factorization Column Generation Algorithmic Optical mapping Multicore architectures Optimal transportation Simulation Mesh adaptation AVX-512 Collision model Heterogeneous computing Low-rank compression FMM Locality Soft-erreur Turbulence Fault tolerance Routing Multicore architecture Discontinuous Galerkin method Gradient Conjugué Robust optimization Fast multipole methods Bandwidth Inverse problem Parallelism Data locality Topology Domain decomposition Accelerators Hybrid parallelization Fish-like swimming Programming model StarPU Cholesky Factorization Robustness ALE Arbitrtary Lagrangian Eulerian Integer programming Fluid mechanics Penalization method Automatic recognition LU factorization Uncertainty Quantification Heterogeneous architectures Sensibilité Sparse direct solver Asymptotic analysis High performance computing Branch-cut-and-price Scheduling DAG based runtime Pénalisation Modeling Multicore Sensitivity Accelerator Multicore Processing Robustesse Placement Distributed computing Load balancing Runtime system Sparse linear solver Starpu-simgrid Penalization HPC NUMA Conjugate Gradient method Bit-flip Discrete velocity model Détection numérique High order scheme Runtime systems Exascale Task-based Analyse numérique MPI Pipeline Runtime GPU