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