Mawussi Zounon

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Luc Giraud

> Home > Persons > Mawussi Zounon

Publications

2016
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/nla/AgulloGGRZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/nla/AgulloGGRZ16
Emmanuel Agullo, Luc Giraud, Abdou Guermouche, Jean Roman, Mawussi Zounon:
Numerical recovery strategies for parallel resilient Krylov linear solvers. Numer. Linear Algebra Appl. 23(5): 888-905 (2016)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/siamsc/AgulloGSZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamsc/AgulloGSZ16
Emmanuel Agullo, Luc Giraud, Pablo Salas, Mawussi Zounon:
Interpolation-Restart Strategies for Resilient Eigensolvers. SIAM J. Sci. Comput. 38(5) (2016)
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/vecpar/AgulloCGMSVYZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vecpar/AgulloCGMSVYZ16
Emmanuel Agullo, Siegfried Cools, Luc Giraud, A. Moreau, Pablo Salas, Wim Vanroose, Emrullah Fatih Yetkin, Mawussi Zounon:
Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers. VECPAR 2016: 11-18
2015
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/hipc/AgulloGZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hipc/AgulloGZ15
Emmanuel Agullo, Luc Giraud, Mawussi Zounon:
On the Resilience of Parallel Sparse Hybrid Solvers. HiPC 2015: 75-84

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.