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