Non-overlapping domain decomposition methods necessarily have to exchange Dirichlet and Neumann traces at interfaces in order to be able to converge to the underlying mono-domain solution. Well known such non-overlapping methods are the Dirichlet-Neumann method, the FETI and Neumann-Neumann methods, and optimized Schwarz methods. For all these methods, cross-points in the domain decomposition configuration where more than two subdomains meet do not pose any problem at the continuous level, but care must be taken when the methods are discretized. We show in this paper two possible approaches for the consistent discretization of Neumann conditions at cross-points in a Finite Element setting.
A balancing domain decomposition by constraints preconditioner for a hybridizable discontinuous Galerkin discretization of an elliptic optimal control problem
Comparing domain decomposition preconditioners for non-conforming Helmholtz discretizations
University of Vienna（维也纳大学）；Sorbonne Université, Université Paris Cité, CNRS, INRIA, Laboratoire Jacques-Louis Lions（索邦大学，巴黎西岱大学，法国国家科学研究中心，法国国家信息与自动化研究所，雅克-路易·利翁斯实验室）；Georg-August-Universität Göttingen（哥廷根大学）
A Symmetry-based Decomposition Approach to Eigenvalue Problems: Formulation, Discretization, and Implementation
Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）；Graduate University of Chinese Academy of Sciences（中国科学院大学）；Institute of Applied Physics and Computational Mathematics（应用物理与计算数学研究所）
This paper proposes a numerical method based on the Adomian decomposition approach for the time discretization, applied to Euler equations. A recursive property is demonstrated that allows to formulate the method in an appropriate and efficient way. To obtain a fully numerical scheme, the space discretization is achieved using the classical DG techniques. The efficiency of the obtained numerical scheme is demonstrated through numerical tests by comparison to exact solution and the popular Runge-Kutta DG method results.
We develop a numerical method for solving the acoustic wave equation in covariant form on staggered curvilinear grids in an energy conserving manner. The use of a covariant basis decomposition leads to a rotationally invariant scheme that outperforms a Cartesian basis decomposition on rotated grids. The discretization is based on high order Summation-By-Parts (SBP) operators and preserves both symmetry and positive definiteness of the contravariant metric tensor. To improve accuracy and decrease computational cost, we also derive a modified discretization of the metric tensor that leads to a c…
We develop non-overlapping domain decomposition methods for the Biot system of poroelasticity in a mixed form. The solid deformation is modeled with a mixed three-field formulation with weak stress symmetry. The fluid flow is modeled with a mixed Darcy formulation. We introduce displacement and pressure Lagrange multipliers on the subdomain interfaces to impose weakly continuity of normal stress and normal velocity, respectively. The global problem is reduced to an interface problem for the Lagrange multipliers, which is solved by a Krylov space iterative method. We study both monolithic and s…
This paper introduces a discretization-accurate stopping criterion of symmetric iterative methods for solving systems of algebraic equations resulting from the finite element approximation. The stopping criterion consists of the evaluations of the discretization and the algebraic error estimators, that are based on the respective duality error estimator and the difference of two consecutive iterates. Iterations are terminated when the algebraic estimator is of the same magnitude as the discretization estimator. Numerical results for multigrid $V(1,1)$-cycle and symmetric Gauss-Seidel iterative…
Stability estimates of Nyström discretizations of Helmholtz decomposition boundary integral equation formulations for the solution of Navier scattering problems in two dimensions with Dirichlet boundary conditions
We present recent finite element numerical results on a model convection-diffusion problem in the singular perturbed case when the convection term dominates the problem. We compare the standard Galerkin discretization using the linear element with a saddle point least square discretization that uses quadratic test functions, trying to control and explain the non-physical oscillations of the discrete solutions. We also relate the up-winding Petrov-Galerkin method and the stream-line diffusion discretization method, by emphasizing the resulting linear systems and by comparing appropriate error n…
In this paper we introduce a new class of finite element discretizations of the quadratic optimal transport problem based on its dynamical formulation. These generalize to the finite element setting the finite difference scheme proposed by Papadakis et al. [SIAM J Imaging Sci, 7(1):212--238,2014]. We solve the discrete problem using a proximal splitting approach and we show how to modify this in the presence of regularization terms which are relevant for physical data interpolation.
We propose a domain decomposition method for the efficient simulation of nonlocal problems. Our approach is based on a multi-domain formulation of a nonlocal diffusion problem where the subdomains share "nonlocal" interfaces of the size of the nonlocal horizon. This system of nonlocal equations is first rewritten in terms of minimization of a nonlocal energy, then discretized with a meshfree approximation and finally solved via a Lagrange multiplier approach in a way that resembles the finite element tearing and interconnect method. Specifically, we propose a distributed projected gradient alg…
In this article we obtain an optimal best approximation type result for fully discrete approximations of the transient Stokes problem. For the time discretization we use the discontinuous Galerkin method and for the spatial discretization we use standard finite elements for the Stokes problem satisfying the discrete inf-sup condition. The analysis uses the technique of discrete maximal parabolic regularity. The results require only natural assumptions on the data and do not assume any additional smoothness of the solutions.
We propose a new three-dimensional formulation based on the mixed Tangential-Displacement Normal-Normal-Stress (TDNNS) method for elasticity. In elastic TDNNS elements, the tangential component of the displacement field and the normal component of the stress vector are degrees of freedom and continuous across inter-element interfaces. TDNNS finite elements have been shown to be locking-free with respect to shear locking in thin elements, which makes them suitable for the discretization of laminates or macro-fibre composites. In the current paper, we extend the formulation to piezoelectric mate…
Driven by the challenging task of finding robust discretization methods for Galbrun's equation, we investigate conditions for stability and different aspects of robustness for different finite element schemes on a simplified version of the equations. The considered PDE is a second order indefinite vector-PDE which remains if only the highest order terms of Galbrun's equation are taken into account. A key property for stability is a Helmholtz-type decomposition which results in a strong connection between stable discretizations for Galbrun's equation and Stokes and nearly incompressible linear …
We construct a space-time parallel method for solving parabolic partial differential equations by coupling the Parareal algorithm in time with overlapping domain decomposition in space. The goal is to obtain a discretization consisting of "local" problems that can be solved on parallel computers efficiently. However, this introduces significant sources of error that must be evaluated. Reformulating the original Parareal algorithm as a variational method and implementing a finite element discretization in space enables an adjoint-based a posteriori error analysis to be performed. Through an app…
This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation, that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. T…
In this paper, a symmetrized two-scale finite element method is proposed for a class of partial differential equations with symmetric solutions. With this method, the finite element approximation on a fine tensor product grid is reduced to the finite element approximations on a much coarse grid and a univariant fine grid. It is shown by both theory and numerics including electronic structure calculations that the resulting approximation still maintains an asymptotically optimal accuracy. Consequently the symmetrized two-scale finite element method reduces computational cost significantly.
We present an effective adaptive procedure for the numerical approximation of the steady-state Gross-Pitaevskii equation. Our approach is solely based on energy minimization, and consists of a combination of gradient flow iterations and adaptive finite element mesh refinements. Numerical tests show that this strategy is able to provide highly accurate results, with optimal convergence rates with respect to the number of freedom.
Domain decomposition methods are widely used for the numerical solution of partial differential equations on high performance computers. We develop an adjoint-based a posteriori error analysis for both multiplicative and additive overlapping Schwarz domain decomposition methods. The numerical error in a user-specified functional of the solution (quantity of interest) is decomposed into contributions that arise as a result of the finite iteration between the subdomains and from the spatial discretization. The spatial discretization contribution is further decomposed into contributions arising f…
This work extends the concepts of algebraic flux correction and convex limiting to continuous high-order Bernstein finite element discretizations of scalar hyperbolic problems. Using an array of adjustable diffusive fluxes, the standard Galerkin approximation is transformed into a nonlinear high-resolution scheme which has the compact sparsity pattern of the piecewise-linear or multilinear subcell discretization. The representation of this scheme in terms of invariant domain preserving states makes it possible to prove the validity of local discrete maximum principles under CFL-like conditions…
In this paper we develop a new a posteriori error analysis for the Monge-Ampère equation approximated by conforming finite element method on isotropic meshes in 2D. The approach utilizes a slight variant of the mixed discretization proposed by Gerard Awanou and Hengguang Li in International Journal of Numerical Analysis and Modeling, 11(4):745-761, 2014. The a posteriori error estimate is based on a suitable evaluation on the residual of the finite element solution. It is proven that the a posteriori error estimate provided in this paper is both reliable and efficient.
A-posteriori-steered $p$-robust multigrid and domain decomposition methods with optimal step-sizes for mixed finite element discretizations of elliptic problems
TU Wien（维也纳工业大学）；Institute of Mathematics, Czech Academy of Sciences（捷克科学院数学研究所）；Inria（法国国家数字科学与多领域研究所）；Ecole nationale des ponts et chaussées（国立路桥学校）；University of Pittsburgh（匹兹堡大学）
In this paper we consider the numerical approximation of a general second order semi-linear parabolic partial differential equation. Equations of this type arise in many contexts, such as transport in porous media. Using finite element method for space discretization and the exponential Rosenbrock-Euler method for time discretization, we provide a rigorous convergence proof in space and time under only the standard Lipschitz condition of the nonlinear part for both smooth and nonsmooth initial solution. This is in contrast to very restrictive assumptions made in the literature, where the autho…
In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show tha…
The focus of this study is the construction and numerical validation of parallel block preconditioners for low order virtual element discretizations of the three-dimensional Maxwell equations. The virtual element method (VEM) is a recent technology for the numerical approximation of partial differential equations (PDEs), that generalizes finite elements to polytopal computational grids. So far, VEM has been extended to several problems described by PDEs, and recently also to the time-dependent Maxwell equations. When the time discretization of PDEs is performed implicitly, at each time-step a …
Maxwell's equations are a system of partial differential equations that govern the laws of electromagnetic induction. We study a mimetic finite-difference (MFD) discretization of the equations which preserves important underlying physical properties. We show that, after mass-lumping and appropriate scaling, the MFD discretization is equivalent to a structure-preserving finite-element (FE) scheme. This allows for a transparent analysis of the MFD method using the FE framework, and provides an avenue for the construction of efficient and robust linear solvers for the discretized system. In parti…
