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