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