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