Frédéric Nataf
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Frédéric Nataf has a total of 177 co-authors. Here are the top co-authors by number of shared publications:
Victorita Dolean
LJAD, Universite Cote d'Azur, CNRS, France, Nice, France
13 shared publications- Isabelle Faille
IFP Energies nouvelles department of mathematics 92500 Rueil-Malmaison France
9 shared publications - Victorita Dolean
University of Nice-Sophia Antipolis
8 shared publications Franck Assous
Department of Mathematics, Ariel University, Ariel, 4076414, Israel
6 shared publications- Pierre-Henri Tournier
Sorbonne Université, CNRS, Laboratoire Jacques-Louis Lions, 75252 Paris Cedex 05, France, and ALPINES team Inria Paris, Paris
6 shared publications - Robert Scheichl
University of Heidelberg
6 shared publications
Latest Publications
- 17 August 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (4) , A2365-A2389
Coarse Spaces for Nonsymmetric Two-Level Preconditioners Based on Local Extended Generalized Eigenproblems
Domain decomposition methods are a natural way to take advantage of parallel computers when solving large scale linear systems. Their scalability depends on the design of the coarse space used in the two-level method. The analysis of adaptive coarse spaces we present here is quite general since it applies to symmetric and nonsymmetric problems, to symmetric preconditioners such as the additive Schwarz method, and to the nonsymmetric preconditioner restricted additive Schwarz, as well as to exact or inexact subdomain solves. The coarse space is built by solving generalized eigenproblems in the subdomains and applying a well-chosen operator to the selected eigenvectors.
- 17 August 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (4) , A2365-A2389
Coarse Spaces for Nonsymmetric Two-Level Preconditioners Based on Local Extended Generalized Eigenproblems
Domain decomposition methods are a natural way to take advantage of parallel computers when solving large scale linear systems. Their scalability depends on the design of the coarse space used in the two-level method. The analysis of adaptive coarse spaces we present here is quite general since it applies to symmetric and nonsymmetric problems, to symmetric preconditioners such as the additive Schwarz method, and to the nonsymmetric preconditioner restricted additive Schwarz, as well as to exact or inexact subdomain solves. The coarse space is built by solving generalized eigenproblems in the subdomains and applying a well-chosen operator to the selected eigenvectors.
- 27 October 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (3) , 1-28
A Robust and Adaptive GenEO-Type Domain Decomposition Preconditioner for $\textbf{H}(\textbf{curl})$ Problems in Three-Dimensional General Topologies- 27 October 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (3) , 1-28
A Robust and Adaptive GenEO-Type Domain Decomposition Preconditioner for $\textbf{H}(\textbf{curl})$ Problems in Three-Dimensional General Topologies- Open Access
Domain decomposition preconditioners for efficient parallel simulations of single-phase flow in three-dimensional fractured porous media with a very large number of fractures
Three-dimensional fractured-porous media are classically described by the Discrete Fracture Matrix (DFM) model, where the rock matrix remains three-dimensional, while the fracture network is of co-dimension one. This study deals with efficient solutions of the linear system arising in single-phase flow in large DFMs using a mixed-hybrid finite element method. It demonstrates the effectiveness of two-level domain decomposition methods based on the GenEO framework for preconditioning iterative solvers applied to such flow problems. Due to the mixed-dimensional nature of the geometry, a specific partitioning strategy is required. The coarse spaces for these preconditioners are built by locally solving spectral problems. This paper presents simulations with very large DFMs, with up to hundreds of thousands of fractures, achieving a low iteration count and short total computation time. Furthermore, this work confirms the scalability of these preconditioners.
Open AccessDomain decomposition preconditioners for efficient parallel simulations of single-phase flow in three-dimensional fractured porous media with a very large number of fractures
Three-dimensional fractured-porous media are classically described by the Discrete Fracture Matrix (DFM) model, where the rock matrix remains three-dimensional, while the fracture network is of co-dimension one. This study deals with efficient solutions of the linear system arising in single-phase flow in large DFMs using a mixed-hybrid finite element method. It demonstrates the effectiveness of two-level domain decomposition methods based on the GenEO framework for preconditioning iterative solvers applied to such flow problems. Due to the mixed-dimensional nature of the geometry, a specific partitioning strategy is required. The coarse spaces for these preconditioners are built by locally solving spectral problems. This paper presents simulations with very large DFMs, with up to hundreds of thousands of fractures, achieving a low iteration count and short total computation time. Furthermore, this work confirms the scalability of these preconditioners.
- 18 August 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (4) , A2378-A2402
A Robust Algebraic Two-Level Schwarz Preconditioner for Sparse Matrices
This paper introduces a fully algebraic two-level additive Schwarz preconditioner for general sparse large-scale matrices. The preconditioner is analyzed for symmetric positive definite (SPD) matrices. For those matrices, the coarse space is constructed based on approximating two local subspaces in each subdomain. These subspaces are obtained by approximating a number of eigenvectors corresponding to dominant eigenvalues of two judiciously posed generalized eigenvalue problems. The number of eigenvectors can be chosen to control the condition number. For general sparse matrices, the coarse space is constructed by approximating the image of a local operator that can be defined from information in the coefficient matrix. The connection between the coarse spaces for SPD and general matrices is also discussed. Unlike robust nonalgebraic coarse spaces, the adaptive condition number bound for the presented coarse space is not fully independent of the number of subdomains, although numerical experiments show the great effectiveness of the proposed preconditioners on matrices arising from a wide range of applications. The set of matrices includes SPD, symmetric indefinite, nonsymmetric, and saddle-point matrices. In addition, we compare the proposed preconditioners to the state-of-the-art domain decomposition preconditioners.
- 18 August 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (4) , A2378-A2402
A Robust Algebraic Two-Level Schwarz Preconditioner for Sparse Matrices
This paper introduces a fully algebraic two-level additive Schwarz preconditioner for general sparse large-scale matrices. The preconditioner is analyzed for symmetric positive definite (SPD) matrices. For those matrices, the coarse space is constructed based on approximating two local subspaces in each subdomain. These subspaces are obtained by approximating a number of eigenvectors corresponding to dominant eigenvalues of two judiciously posed generalized eigenvalue problems. The number of eigenvectors can be chosen to control the condition number. For general sparse matrices, the coarse space is constructed by approximating the image of a local operator that can be defined from information in the coefficient matrix. The connection between the coarse spaces for SPD and general matrices is also discussed. Unlike robust nonalgebraic coarse spaces, the adaptive condition number bound for the presented coarse space is not fully independent of the number of subdomains, although numerical experiments show the great effectiveness of the proposed preconditioners on matrices arising from a wide range of applications. The set of matrices includes SPD, symmetric indefinite, nonsymmetric, and saddle-point matrices. In addition, we compare the proposed preconditioners to the state-of-the-art domain decomposition preconditioners.
- 23 January 2024
- Published by Springer Nature
- p. 223-230
Substructuring of Arbitrary Domain Decomposition Methods
- 23 January 2024
- Published by Springer Nature
- p. 223-230
Substructuring of Arbitrary Domain Decomposition Methods
- 23 January 2024
- Published by Springer Nature
- p. 61-68
How Does the Partition of Unity Influence SORAS Preconditioner?
- 23 January 2024
- Published by Springer Nature
- p. 61-68
How Does the Partition of Unity Influence SORAS Preconditioner?
- Open Access
A Unified Framework for Double Sweep Methods for the Helmholtz Equation
We consider sweeping domain decomposition preconditioners to solve the Helmholtz equation in the case of stripwise domain decomposition with or without overlaps. We unify their derivation and convergence studies by expressing them as Jacobi, Gauss-Seidel, and Symmetric Gauss-Seidel methods for different numbering of the unknowns. The proposed framework enables theoretical comparisons between the double sweep methods in [Nataf and Nier (1997), Vion and Geuzaine (2018)] and those in [Stolk (2013, 2017), Vion and Geuzaine (2014)]. Additionally, it facilitates the introduction of a new sweeping algorithm. We provide numerical test cases to assess the validity of the theoretical studies.
Open AccessA Unified Framework for Double Sweep Methods for the Helmholtz Equation
We consider sweeping domain decomposition preconditioners to solve the Helmholtz equation in the case of stripwise domain decomposition with or without overlaps. We unify their derivation and convergence studies by expressing them as Jacobi, Gauss-Seidel, and Symmetric Gauss-Seidel methods for different numbering of the unknowns. The proposed framework enables theoretical comparisons between the double sweep methods in [Nataf and Nier (1997), Vion and Geuzaine (2018)] and those in [Stolk (2013, 2017), Vion and Geuzaine (2014)]. Additionally, it facilitates the introduction of a new sweeping algorithm. We provide numerical test cases to assess the validity of the theoretical studies.
- 21 June 2023
- Published by Elsevier in Journal of Computational Physics
- Vol. 490
A unified framework for double sweep methods for the Helmholtz equation
- 21 June 2023
- Published by Elsevier in Journal of Computational Physics
- Vol. 490
A unified framework for double sweep methods for the Helmholtz equation
- 1 January 2023
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mécanique
- Vol. 351 (S1) , 667-684
A GenEO Domain Decomposition method for Saddle Point problems
We introduce an adaptive element-based domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space. We assume that all sub matrices are sparse and that the diagonal blocks are spectrally equivalent to a sum of positive semi definite matrices. The latter assumption enables the design of adaptive coarse space for DD methods that extends the GenEO theory (Spillane et al., 2014) to saddle point problems. Numerical results on three dimensional elasticity problems for steel-rubber structures discretized by a finite element with continuous pressure are shown for up to one billion degrees of freedom.
- 1 January 2023
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mécanique
- Vol. 351 (S1) , 667-684
A GenEO Domain Decomposition method for Saddle Point problems
We introduce an adaptive element-based domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space. We assume that all sub matrices are sparse and that the diagonal blocks are spectrally equivalent to a sum of positive semi definite matrices. The latter assumption enables the design of adaptive coarse space for DD methods that extends the GenEO theory (Spillane et al., 2014) to saddle point problems. Numerical results on three dimensional elasticity problems for steel-rubber structures discretized by a finite element with continuous pressure are shown for up to one billion degrees of freedom.
- 1 January 2022
- Published by Springer Nature
- p. 17-28
Several Ways to Achieve Robustness When Solving Wave Propagation Problems
- 1 January 2022
- Published by Springer Nature
- p. 17-28
Several Ways to Achieve Robustness When Solving Wave Propagation Problems