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