Two‐level preconditioners for serendipity finite element matrices

In this paper an approach to construct algebraic multilevel preconditioners for serendipity finite element matrices is presented. Two‐level preconditioners constructed in the paper allow to obtain multilevel preconditioners in serendipity case using multilevel preconditioners for linear finite element matrices. Copyright © 2006 John Wiley & Sons, Ltd.     

Overlapping Schwarz preconditioners for indefinite time harmonic Maxwell equations

Time harmonic Maxwell equations in lossless media lead to a second order differential equation for the electric field involving a differential operator that is neither elliptic nor definite. A Galerkin method using Nedelec spaces can be employed to get approximate solutions numerically. The problem of preconditioning the indefinite matrix arising from this method is discussed here. Specifically, two overlapping Schwarz methods will be shown to yield uniform preconditioners.

     

Multilevel preconditioners for a quadrature Galerkin solution of a biharmonic problem

Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Spectral properties of primal-based penalty preconditioners for saddle point problems

For large and sparse saddle point linear systems, this paper gives further spectral properties of the primal-based penalty preconditioners introduced in [C.R. Dohrmann, R.B. Lehoucq, A primal-based penalty preconditioner for elliptic saddle point systems, SIAM J. Numer. Anal. 44 (2006) 270-282]. The regions containing the real and non-real eigenvalues of the preconditioned matrix are obtained. The model of the Stokes problem is supplemented to illustrate the theoretical results and to test the quality of the primal-based penalty preconditioner.     

A robust optimal preconditioner for the mixed finite element discretization of elliptic optimal control problems

In this paper, we consider the efficient solving of the resulting algebraic system for elliptic optimal control problems with mixed finite element discretization. We propose a block‐diagonal preconditioner for the symmetric and indefinite algebraic system solved with minimum residual method, which is proved to be robust and optimal with respect to both the mesh size and the regularization parameter. The block‐diagonal preconditioner is constructed based on an isomorphism between appropriately chosen solution space and its dual for a general control problem with both state and gradient state observations in the objective functional. Numerical experiments confirm the efficiency of our proposed preconditioner.     

Fast solvers with block‐diagonal preconditioners for linear FEM–BEM coupling

The purpose of this paper is to present optimal preconditioned iterative methods to solve indefinite linear systems of equations arising from symmetric coupling of finite elements and boundary elements. This is a block‐diagonal preconditioner together with a conjugate residual method and a preconditioned inner–outer iteration. We prove the efficiency of these methods by showing that the number of iterations to preserve a given accuracy is bounded independent of the number of unknowns. Numerical examples underline the efficiency of these methods. Copyright © 2008 John Wiley & Sons, Ltd.     

Circulant-block preconditioners for solving ordinary differential equations

Boundary value methods for solving ordinary differential equations require the solution of non-symmetric, large and sparse linear systems. In this paper, these systems are solved by using the generalized minimal residual (GMRES) method. A circulant-block preconditioner is proposed to speed up the convergence rate of the GMRES method. Theoretical and practical arguments are given to show that this preconditioner is more efficient than some other circulant-type preconditioners in some cases. A class of waveform relaxation methods is also proposed to solve the linear systems.     

Optimization of the parameterized Uzawa preconditioners for saddle point matrices

The parameterized Uzawa preconditioners for saddle point problems are studied in this paper. The eigenvalues of the preconditioned matrix are located in (0, 2) by choosing the suitable parameters. Furthermore, we give two strategies to optimize the rate of convergence by finding the suitable values of parameters. Numerical computations show that the parameterized Uzawa preconditioners can lead to practical and effective preconditioned GMRES methods for solving the saddle point problems.     

Domain decomposition preconditioners of Neumann-Neumann type for hp-approximations on boundary layer meshes in three dimensions

We develop and analyse Neumann–Neumann methods for hpfinite-element approximations of scalar elliptic problems ongeometrically refined boundary layer meshes in three dimensions.These are meshes that are highly anisotropic where the aspectratio typically grows exponentially with the polynomial degree.The condition number of our preconditioners is shown to be independentof the aspect ratio of the mesh and of potentially large jumpsof the coefficients. In addition, it only grows polylogarithmicallywith the polynomial degree, as in the case of p approximationson shape-regular meshes. This work generalizes our previousone on two-dimensional problems in Toselli & Vasseur (2003a,submitted to Numerische Mathematik, 2003c to appear in Comput.Methods Appl. Mech. Engng.) and the estimates derived here canbe employed to prove condition number bounds for certain typesof FETI methods.     

Interior penalty preconditioners for mixed finite element approximations of elliptic problems

It is established that an interior penalty method applied to second-order elliptic problems gives rise to a local operator which is spectrally equivalent to the corresponding nonlocal operator arising from the mixed finite element method. This relation can be utilized in order to construct preconditioners for the discrete mixed system. As an example, a family of additive Schwarz preconditioners for these systems is constructed. Numerical examples which confirm the theoretical results are also presented.

     

The fictitious domain method with L2‐penalty for the Stokes problem with the Dirichlet boundary condition

We consider the fictitious domain method with L²‐penalty for the Stokes problem with the Dirichlet boundary condition. First, we investigate the error estimates for the penalty method at the continuous level. We obtain the convergence of order in H¹‐norm for the velocity and in L²‐norm for the pressure, where is the penalty parameter. The L²‐norm error estimate for the velocity is upgraded to . Moreover, we derive the a priori estimates depending on for the solution of the penalty problem. Next, we apply the finite element approximation to the penalty problem using the P1/P1 element with stabilization. For the discrete penalty problem, we prove the error estimate in H¹‐norm for the velocity and in L²‐norm for the pressure, where h denotes the discretization parameter. For the velocity in L²‐norm, the convergence rate is improved to . The theoretical results are verified by the numerical experiments.     

An unfitted interface penalty method for the numerical approximation of contrast problems

We aim to approximate contrast problems by means of a numerical scheme which does not require that the computational mesh conforms with the discontinuity between coefficients. We focus on the approximation of diffusion-reaction equations in the framework of finite elements. In order to improve the unsatisfactory behavior of Lagrangian elements for this particular problem, we resort to an enriched approximation space, which involves elements cut by the interface. Firstly, we analyze the H¹-stability of the finite element space with respect to the position of the interface. This analysis, applied to the conditioning of the discrete system of equations, shows that the scheme may be ill posed for some configurations of the interface. Secondly, we propose a stabilization strategy, based on a scaling technique, which restores the standard properties of a Lagrangian finite element space and results to be very easily implemented. We also address the behavior of the scheme with respect to large contrast problems ending up with a choice of Nitsche?s penalty terms such that the extended finite element scheme with penalty is robust for the worst case among small sub-elements and large contrast problems. The theoretical results are finally illustrated by means of numerical experiments.     

Short Communication: A note on optimal hybrid V-cycle multilevel algorithms for mixed finite element systems with penalty term

In this paper, we investigate some cost-effective hybrid V-cycle multilevel algorithms for the discrete systems that arise when a mixed finite element approach is used to solve certain second-order elliptic boundary value problems. By introducing a small penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system involving the unknown flux alone. We study the numerical behaviour of some hybrid V-cycle multilevel algorithms with optimal computational complexity based on the hierarchical spatial decomposition approach proposed by Cai, Goldstein and Pasciaks for the reduced system. © 1997 by John Wiley & Sons, Ltd.     

BCCB preconditioners for systems of BVM‐based numerical integrators

Boundary value methods (BVMs) for ordinary differential equations require the solution of non‐symmetric, large and sparse linear systems. In this paper, these systems are solved by using the generalized minimal residual (GMRES) method. A block‐circulant preconditioner with circulant blocks (BCCB preconditioner) is proposed to speed up the convergence rate of the GMRES method. The BCCB preconditioner is shown to be invertible when the BVM is A_k1,k2‐stable. The spectrum of the preconditioned matrix is clustered and therefore, the preconditioned GMRES method converges fast. Moreover, the operation cost in each iteration of the preconditioned GMRES method by using our BCCB preconditioner is less than that required by using block‐circulant preconditioners proposed earlier. In numerical experiments, we compare the number of iterations of various preconditioners. Copyright © 2003 John Wiley & Sons, Ltd.     

A new ϕ-FEM approach for problems with natural boundary conditions

We present a new finite element method, called $\varphi$-FEM, to solve numerically elliptic partial differential equations with natural (Neumann or Robin) boundary conditions using simple computational grids, not fitted to the boundary of the physical domain. The boundary data are taken into account using a level-set function, which is a popular tool to deal with complicated or evolving domains. Our approach belongs to the family of fictitious domain methods (or immersed boundary methods) and is close to recent methods of CutFEM/XFEM type. Contrary to the latter, $\varphi$-FEM does not need any nonstandard numerical integration on cut mesh elements or on the actual boundary, while assuring the optimal convergence orders with finite elements of any degree and providing reasonably well conditioned discrete problems. In the first version of $\varphi$-FEM, only essential (Dirichlet) boundary conditions was considered. Here, to deal with natural boundary conditions, we introduce the gradient of the primary solution as an auxiliary variable. This is done only on the mesh cells cut by the boundary, so that the size of the numerical system is only slightly increased. We prove theoretically the optimal convergence of our scheme and a bound on the discrete problem conditioning, independent of the mesh cuts. The numerical experiments confirm these results.     

Fictitious domain method with penalty for an incompressible fluid

Fictitious domain method shows great advantages when handling problems with complex and constantly varying domains. In this article, we propose an algorithm which extends the fictitious domain method by introducing penalties. Test results with the numerical examples of backward facing step problem and the flow around steady and dynamic cylinder problem show that the algorithm we propose is highly efficient for solving incompressible fluid problems. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Unfitted finite element methods for the heat conduction in composite media with contact resistance

This article is concerned with the heat conduction problem in composite media. In practical applications, the composite materials often do not contact well and there exist gaps between the contacting materials. This leads to the thermal contact resistance effect which results in a discontinuity of the temperature across the interface. In this article, an unfitted finite element method is proposed to solve the problem. Different from the traditional finite element method, the proposed method uses structured meshes that allow the interface to cut through. To avoid integrating on curved domains and interfaces, the interface is approximated by a broken line/plane corresponding to the triangulation. In addition, a ghost‐penalty is added to recover the condition number of the stiffness matrix to with a hidden constant independent of the mesh‐interface geometry. A rigorous analysis is provided. Finally, numerical tests are presented to verify the theoretical findings. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 354–380, 2017     

A nonconforming domain decomposition approximation for the Helmholtz screen problem with hypersingular operator

We present and analyze a nonconforming domain decomposition approximation for a hypersingular operator governed by the Helmholtz equation in three dimensions. This operator appears when considering the corresponding Neumann problem in unbounded domains exterior to open surfaces. We consider small wave numbers and low‐order approximations with Nitsche coupling across interfaces. Under appropriate assumptions on mapping properties of the weakly singular and hypersingular operators with Helmholtz kernel, we prove that this method converges almost quasioptimally, that is, with optimal orders reduced by an arbitrarily small positive number. Numerical experiments confirm our error estimate. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 125–141, 2017     

Substructuring preconditioners for saddle-point problems arising from Maxwell's equations in three dimensions

This paper is concerned with the saddle-point problems arising from edge element discretizations of Maxwell's equations in a general three dimensional nonconvex polyhedral domain. A new augmented technique is first introduced to transform the problems into equivalent augmented saddle-point systems so that they can be solved by some existing preconditioned iterative methods. Then some substructuring preconditioners are proposed, with very simple coarse solvers, for the augmented saddle-point systems. With the preconditioners, the condition numbers of the preconditioned systems are nearly optimal; namely, they grow only as the logarithm of the ratio between the subdomain diameter and the finite element mesh size.