Some advances in numerical algebraic geometry for computing real solutions
De Jon Hauenstein
Multiscale Basis Dictionaries and Scattering Networks on Simplicial Complexes
De Naoki Saito
Apparaît dans la collection : Parallel Solution Methods for Systems Arising from PDEs / Méthodes parallèles pour la résolution de systèmes issus d'équations aux dérivées partielles
This talk focuses on challenges that we address when designing linear solvers that aim at achieving scalability on large scale computers, while also preserving numerical robustness. We will consider preconditioned Krylov subspace solvers. Getting scalability relies on reducing global synchronizations between processors, while also increasing the arithmetic intensity on one processor. Achieving robustness relies on ensuring that the condition number of the preconditioned matrix is bounded. We will discuss two different approaches for this. The first approach relies on enlarged Krylov subspace methods that aim at computing an enlarged subspace and obtain a faster convergence of the iterative method. The second approach relies on a multilevel Schwarz preconditioner, a multilevel extension of the GenEO preconditioner, that is basedon constructing robustly a hierarchy of coarse spaces. Numerical results on large scale computers, in particular for linear systems arising from solving linear elasticity problems, will discuss the efficiency of the proposed methods.