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