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