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