1.2NAMay 14, 2017Code
Explicit implementation strategy of high order edge finite elements and Schwarz preconditioning for the time-harmonic Maxwell's equationsMarcella Bonazzoli, Victorita Dolean, Frédéric Hecht et al.
In this paper we focus on high order finite element approximations of the electric field combined with suitable preconditioners, to solve the time-harmonic Maxwell's equations in waveguide configurations. The implementation of high order curl-conforming finite elements is quite delicate, especially in the three-dimensional case. Here, we explicitly describe an implementation strategy, which has been embedded in the open source finite element software FreeFem++ (http://www.freefem.org/ff++/). In particular, we use the inverse of a generalized Vandermonde matrix to build a basis of generators in duality with the degrees of freedom, resulting in an easy-to-use but powerful interpolation operator. We carefully address the problem of applying the same Vandermonde matrix to possibly differently oriented tetrahedra of the mesh over the computational domain. We investigate the preconditioning for Maxwell's equations in the time-harmonic regime, which is an underdeveloped issue in the literature, particularly for high order discretizations. In the numerical experiments, we study the effect of varying several parameters on the spectrum of the matrix preconditioned with overlapping Schwarz methods, both for 2d and 3d waveguide configurations.
1.2NAMay 14, 2016
Nonlinear Preconditioning: How to use a Nonlinear Schwarz Method to Precondition Newton's MethodV. Dolean, M. J. Gander, F. Kwok et al.
For linear problems, domain decomposition methods can be used directly as iterative solvers, but also as preconditioners for Krylov methods. In practice, Krylov acceleration is almost always used, since the Krylov method finds a much better residual polynomial than the stationary iteration, and thus converges much faster. We show in this paper that also for non-linear problems, domain decomposition methods can either be used directly as iterative solvers, or one can use them as preconditioners for Newton's method. For the concrete case of the parallel Schwarz method, we show that we obtain a preconditioner we call RASPEN (Restricted Additive Schwarz Preconditioned Exact Newton) which is similar to ASPIN (Additive Schwarz Preconditioned Inexact Newton), but with all components directly defined by the iterative method. This has the advantage that RASPEN already converges when used as an iterative solver, in contrast to ASPIN, and we thus get a substantially better preconditioner for Newton's method. The iterative construction also allows us to naturally define a coarse correction using the multigrid full approximation scheme, which leads to a convergent two level non-linear iterative domain decomposition method and a two level RASPEN non-linear preconditioner. We illustrate our findings with numerical results on the Forchheimer equation and a non-linear diffusion problem.
1.2NAFeb 21, 2018
Two-level preconditioners for the Helmholtz equationMarcella Bonazzoli, Victorita Dolean, Ivan Graham et al.
In this paper we compare numerically two different coarse space definitions for two-level domain decomposition preconditioners for the Helmholtz equation, both in two and three dimensions. While we solve the pure Helmholtz problem without absorption, the preconditioners are built from problems with absorption. In the first method, the coarse space is based on the discretization of the problem with absorption on a coarse mesh, with diameter constrained by the wavenumber. In the second method, the coarse space is built by solving local eigenproblems involving the Dirichlet-to-Neumann (DtN) operator.
1.2NAFeb 21, 2018
A two-level domain-decomposition preconditioner for the time-harmonic Maxwell's equationsMarcella Bonazzoli, Victorita Dolean, Ivan Graham et al.
The construction of fast iterative solvers for the indefinite time-harmonic Maxwell's system at mid- to high-frequency is a problem of great current interest. Some of the difficulties that arise are similar to those encountered in the case of the mid- to high-frequency Helmholtz equation. Here we investigate how two-level domain-decomposition preconditioners recently proposed for the Helmholtz equation work in the Maxwell case, both from the theoretical and numerical points of view.
1.2NAOct 31, 2018
Can classical Schwarz methods for time-harmonic elastic waves converge?Romain Brunet, Victorita Dolean, Martin J. Gander
We show that applying a classical Schwarz method to the time harmonic Navier equations, which are an important model for linear elasticity, leads in general to a divergent method for low to intermediate frequencies. This is even worse than for Helmholtz and time harmonic Maxwell's equations, where the classical Schwarz method is also not convergent, but low frequencies only stagnate, they do not diverge. We illustrate the divergent modes by numerical examples, and also show that when using the classical Schwarz method as a preconditioner for a Krylov method, convergence difficulties remain.
6.7NAMar 30
ELM-FBPINNs: An Efficient Multilevel Random Feature MethodSamuel Anderson, Victorita Dolean, Ben Moseley et al.
Domain-decomposed variants of physics-informed neural networks (PINNs) such as finite basis PINNs (FBPINNs) mitigate some of PINNs' issues like slow convergence and spectral bias through localisation, but still rely on iterative nonlinear optimisation within each subdomain. In this work, we propose a hybrid approach that combines multilevel domain decomposition and partition-of-unity constructions with random feature models, yielding a method referred to as multilevel ELM-FBPINN. By replacing trainable subdomain networks with extreme learning machines, the resulting formulation eliminates backpropagation entirely and reduces training to a structured linear least-squares problem. We provide a systematic numerical study comparing ELM-FBPINNs and multilevel ELM-FBPINNs with standard PINNs and FBPINNs on representative benchmark problems, demonstrating that ELM-FBPINNs and multilevel ELM-FBPINNs achieve competitive accuracy while significantly accelerating convergence and improving robustness with respect to architectural and optimisation parameters. Through ablation studies, we further clarify the distinct roles of domain decomposition and random feature enrichment in controlling expressivity, conditioning, and scalability.
1.2NAOct 30, 2018
Stabilised hybrid discontinuous Galerkin methods for the Stokes problem with non-standard boundary conditionsGabriel R. Barrenechea, Michał Bosy, Victorita Dolean
In several studies it has been observed that, when using stabilised $\mathbb{P}_k^{}\times\mathbb{P}_k^{}$ elements for both velocity and pressure, the error for the pressure is smaller, or even of a higher order in some cases, than the one obtained when using inf-sup stable $\mathbb{P}_k^{}\times\mathbb{P}_{k-1}^{}$ (although no formal proof of either of these facts has been given). This increase in polynomial order requires the introduction of stabilising terms, since the finite element pairs used do not stability the inf-sup condition. With this motivation, we apply the stabilisation approach to the hybrid discontinuous Galerkin discretisation for the Stokes problem with non-standard boundary conditions.
3.3NAFeb 6
Can Symmetric Positive Definite (SPD) coarse spaces perform well for indefinite Helmholtz problems?Victorita Dolean, Mark Fry, Matthias Langer
Wave propagation problems governed by the Helmholtz equation remain among the most challenging in scientific computing, due to their indefinite nature. Domain decomposition methods with spectral coarse spaces have emerged as some of the most effective preconditioners, yet their theoretical guarantees often lag behind practical performance. In this work, we introduce and analyse the $Î_k$-GenEO coarse space within the two-level additive Schwarz preconditioners for heterogeneous Helmholtz problems. This is an adaptation of the $Î$-GenEO coarse space. Our results sharpen the $k$-explicit conditions for GMRES convergence, reducing the restrictions on the subdomain size and eigenvalue threshold. This narrows the long-standing gap between pessimistic theory and empirical evidence, and reveals why GenEO spaces based on SPD (symmetric positive definite) eigenvalue problems remain surprisingly effective despite their apparent limitations. Numerical experiments confirm the theory, demonstrating scalability, robustness to heterogeneity for low to moderate frequencies (while experiencing limitations in the high frequency cases), and significantly milder coarse-space growth than conservative estimates predict.
2.6LGAug 22, 2024
Two-level deep domain decomposition methodVictorita Dolean, Serge Gratton, Alexander Heinlein et al.
This study presents a two-level Deep Domain Decomposition Method (Deep-DDM) augmented with a coarse-level network for solving boundary value problems using physics-informed neural networks (PINNs). The addition of the coarse level network improves scalability and convergence rates compared to the single level method. Tested on a Poisson equation with Dirichlet boundary conditions, the two-level deep DDM demonstrates superior performance, maintaining efficient convergence regardless of the number of subdomains. This advance provides a more scalable and effective approach to solving complex partial differential equations with machine learning.
1.2NANov 19, 2025
Neural network-driven domain decomposition for efficient solutions to the Helmholtz equationVictorita Dolean, Daria Hrebenshchykova, Stéphane Lanteri et al.
Accurately simulating wave propagation is crucial in fields such as acoustics, electromagnetism, and seismic analysis. Traditional numerical methods, like finite difference and finite element approaches, are widely used to solve governing partial differential equations (PDEs) such as the Helmholtz equation. However, these methods face significant computational challenges when applied to high-frequency wave problems in complex two-dimensional domains. This work investigates Finite Basis Physics-Informed Neural Networks (FBPINNs) and their multilevel extensions as a promising alternative. These methods leverage domain decomposition, partitioning the computational domain into overlapping sub-domains, each governed by a local neural network. We assess their accuracy and computational efficiency in solving the Helmholtz equation for the homogeneous case, demonstrating their potential to mitigate the limitations of traditional approaches.
1.2NAApr 27, 2019
Natural domain decomposition algorithms for the solution of time-harmonic elastic wavesRomain Brunet, Victorita Dolean, Martin J. Gander
We study for the first time Schwarz domain decomposition methods for the solution of the Navier equations modeling the propagation of elastic waves. These equations in the time harmonic regime are difficult to solve by iterative methods, even more so than the Helmholtz equation. We first prove that the classical Schwarz method is not convergent when applied to the Navier equations, and can thus not be used as an iterative solver, only as a preconditioner for a Krylov method. We then introduce more natural transmission conditions between the subdomains, and show that if the overlap is not too small, this new Schwarz method is convergent. We illustrate our results with numerical experiments, both for situations covered by our technical two subdomain analysis, and situations that go far beyond, including many subdomains, cross points, heterogeneous materials in a transmission problem, and Krylov acceleration. Our numerical results show that the Schwarz method with adapted transmission conditions leads systematically to a better solver for the Navier equations than the classical Schwarz method.
5.9NASep 26, 2008
Optimized Schwarz Methods for Maxwell equationsVictorita Dolean, Martin Gander, Luca Gerardo-Giorda
Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, and it was observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for which overlap is essential for convergence. Over the last decade, optimized Schwarz methods have been developed for elliptic partial differential equations. These methods use more effective transmission conditions between subdomains, and are also convergent without overlap for elliptic problems. We show here why the classical Schwarz method applied to the hyperbolic problem converges without overlap for Maxwell's equations. The reason is that the method is equivalent to a simple optimized Schwarz method for an equivalent elliptic problem. Using this link, we show how to develop more efficient Schwarz methods than the classical ones for the Maxwell's equations. We illustrate our findings with numerical results.
1.2NAApr 11, 2007
Solution of the time-harmonic Maxwell equations using discontinuous Galerkin methodsVictorita Dolean, Hugo Fol, Stephane Lanteri et al.
We present numerical results concerning the solution of the time-harmonic Maxwell's equations discretized by discontinuous Galerkin methods. In particular, a numerical study of the convergence, which compares different strategies proposed in the literature for the elliptic Maxwell equations, is performed in the two-dimensional case.
4.3NAFeb 23, 2005
New constructions of domain decomposition methods for systems of PDEsVictorita Dolean, Frédéric Nataf, Gerd Rapin
We propose new domain decomposition methods for systems of partial differential equations in two and three dimensions. The algorithms are derived with the help of the Smith factorization of the operator. This could also be validated by numerical experiments.
2.3NAFeb 22, 2005
A New Domain Decomposition Method for the Compressible Euler EquationsVictorita Dolean, Frédéric Nataf
In this work we design a new domain decomposition method for the Euler equations in 2 dimensions. The basis is the equivalence via the Smith factorization with a third order scalar equation to whom we can apply an algorithm inspired from the Robin-Robin preconditioner for the convection-diffusion equation. Afterwards we translate it into an algorithm for the initial system and prove that at the continuous level and for a decomposition into 2 sub-domains, it converges in 2 iterations. This property cannot be preserved strictly at discrete level and for arbitrary domain decompositions but we still have numerical results which confirm a very good stability with respect to the various parameters of the problem (mesh size, Mach number, ....).