Dual-primal FETI algorithms for edge finite-element approximations in 3D

A family of dual-primal finite-element tearing and interconnecting methods for edge-element approximations in 3D is proposed and analysed. The key part of this work relies on the observation that for these finite-element spaces there is a strong coupling between degrees of freedom associated with subdomain edges and faces and a local change of basis is therefore necessary. The primal constraints are associated with subdomain edges. We propose three methods. They ensure a condition number that is independent of the number of substructures and possibly large jumps of one of the coefficients of the original problem, and only depends on the number of unknowns associated with a single substructure, as for the corresponding methods for continuous nodal elements. A polylogarithmic dependence is shown for two algorithms. Numerical results validating our theoretical bounds are give

Substructuring the Hiptmair-Xu preconditioner for positive Maxwell problems

Considering positive Maxwell problems, we propose a substructured version of the Hiptmair-Xu preconditioner based on a new formula that expresses the inverse of Schur systems in terms of the inverse matrix of the global volume problem

Test-Driven Development of a Substructuring Technique for the Analysis of Electromagnetic Finite Periodic Structures

In this paper, we follow the Test-Driven Development (TDD) paradigm in the development of an in-house code to allow for the finite element analysis of finite periodic type electromagnetic structures (e.g., antenna arrays, metamaterials, and several relevant electromagnetic problems). We use unit and integration tests, system tests (using the Method of Manufactured Solutions—MMS), and application tests (smoke, performance, and validation tests) to increase the reliability of the code and to shorten its development cycle. We apply substructuring techniques based on the definition of a unit cell to benefit from the repeatability of the problem and speed up the computations. Specifically, we propose an approach to model the problem using only one type of Schur complement which has advantages concerning other substructuring techniques.This work has been financially supported by TEC2016-80386-P and PID2019-109984RB-C41

Schnelle Löser für partielle Differentialgleichungen

The workshop Schnelle Löser für partielle Differentialgleichungen, organised by Randolph E. Bank (La Jolla), Wolfgang Hackbusch(Leipzig), Gabriel Wittum (Heidelberg) was held May 22nd - May 28th, 2005. This meeting was well attended by 47 participants with broad geographic representation from 9 countries and 3 continents. This workshop was a nice blend of researchers with various backgrounds

Scalable solvers for complex electromagnetics problems

In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce the continuity across subdomains of the method, we use a partition of the interface objects (edges and faces) into sub-objects determined by the variation of the physical coefficients of the problem. For multi-material problems, a constant coefficient condition is enough to define this sub-partition of the objects. For arbitrarily heterogeneous problems, a relaxed version of the method is defined, where we only require that the maximal contrast of the physical coefficient in each object is smaller than a predefined threshold. Besides, the addition of perturbation terms to the preconditioner is empirically shown to be effective in order to deal with the case where the two coefficients of the model problem jump simultaneously across the interface. The new method, in contrast to existing approaches for problems in curl-conforming spaces does not require spectral information whilst providing robustness with regard to coefficient jumps and heterogeneous materials. A detailed set of numerical experiments, which includes the application of the preconditioner to 3D realistic cases, shows excellent weak scalability properties of the implementation of the proposed algorithms

Schnelle Löser für Partielle Differentialgleichungen

The workshop Schnelle Löser für partielle Differentialgleichungen, organised by Randolph E. Bank (La Jolla), Wolfgang Hackbusch (Leipzig), and Gabriel Wittum (Frankfurt am Main), was held May 22nd–May 28th, 2011. This meeting was well attended by 54 participants with broad geographic representation from 7 countries and 3 continents. This workshop was a nice blend of researchers with various backgrounds

Effective transmission conditions for domain decomposition methods applied to the time-harmonic curl-curl Maxwell's equations

The time-harmonic Maxwell equations describe the propagation of electromagnetic waves and are therefore fundamental for the simulation of many modern devices we have become used to in everyday life. The numerical solution of these equations is hampered by two fundamental problems: first, in the high frequency regime, very fine meshes need to be used in order to avoid the pollution effect well known for the Helmholtz equation, and second the large scale systems obtained from the vector valued equations in three spatial dimensions need to be solved by iterative methods, since direct factorizations are not feasible any more at that scale. As for the Helmholtz equation, classical iterative methods applied to discretized Maxwell equations have severe convergence problems.We explain in this paper a family of domain decomposition methods based on well chosen transmission conditions. We show that all transmission conditions proposed so far in the literature, both for the first and second order formulation of Maxwell's equations, can be written and optimized in the common framework of optimized Schwarz methods, independently of the first or second order formulation one uses, and the performance of the corresponding algorithms is identical. We use a decomposition into transverse electric and transverse magnetic fields to describe these algorithms, which greatly simplifies the convergence analysis of the methods. We illustrate the performance of our algorithms with large scale numerical simulations