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