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