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