In this paper, we propose a Static Condensation Reduced Basis Element (SCRBE) approach for the Reynolds Lubrication Equation (RLE). The SCRBE method is a computational tool that allows to efficiently analyze parametrized structures which can be decomposed into a large number of similar components. Here, we extend the methodology to allow for a more general domain decomposition, a typical example being a checkerboard-pattern assembled from similar components. To this end, we extend the formulation and associated a posteriori error bound procedure. Our motivation comes from the analysis of the pressure distribution in plain journal bearings governed by the RLE. However, the SCRBE approach presented is not limited to bearings and the RLE, but directly extends to other component-based systems. We show numerical results for plain bearings to demonstrate the validity of the proposed approach.

This paper provides a proof of robustness of the restricted additive Schwarz preconditioner with harmonic overlap (RASHO) for the second order elliptic problems with jump coefficients. By analyzing the eigenvalue distribution of the RASHO preconditioner, we prove that the convergence rate of preconditioned conjugate gradient method with RASHO preconditioner is uniform with respect to the large jump and meshsize.

In order to solve the partial differential equations that arise in the Hartree- Fock theory for diatomicmolecules and inmolecular theories that include electron correlation, one needs efficient methods for solving partial differential equations. In this article, we present numerical results for a two-variablemodel problem of the kind that arises when one solves the Hartree-Fock equations for a diatomic molecule. We compare results obtained using the spline collocation and domain decomposition methods with third-order Hermite splines to results obtained using the more-established finite difference approximation and the successive over-relaxation method. The theory of domain decomposition presented earlier is extended to treat regions that are divided into an arbitrary number of subregions by families of lines parallel to the two coordinate axes. While the domain decomposition method and the finite difference approach both yield results at the micro-Hartree level, the finite difference approach with a 9- point difference formula produces the same level of accuracy with fewer points. The domain decompositionmethod has the strength that it can be applied to problemswith a large number of grid points. The time required to solve a partial differential equation for a fine grid with a large number of points goes down as the number of partitions increases. The reason for this is that the length of time necessary for solving a set of linear equations in each subregion is very much dependent upon the number of equations. Even though a finer partition of the region has more subregions, the time for solving the set of linear equations in each subregion is very much smaller. This feature of the theory may well prove to be a decisive factor for solving the two-electron pair equation, which – for a diatomic molecule – involves solving partial differential equations with five independent variables. The domain decomposition theory also makes it possible to study complex molecules by dividing them into smaller fragments that are calculated independently. Since the domain decomposition approachmakes it possible to decompose the variable space into separate regions in which the equations are solved independently, this approach is well-suited to parallel computing.

In this paper, we are concerned with the constrained finite element method based on domain decomposition satisfying the discrete maximum principle for diffusion problems with discontinuous coefficients on distorted meshes. The basic idea of domain decomposition methods is used to deal with the discontinuous coefficients. To get the information on the interface, we generalize the traditional Neumann-Neumann method to the discontinuous diffusion tensors case. Then, the constrained finite element method is used in each subdomain. Comparing with the method of using the constrained finite element method on the global domain, the numerical experiments show that not only the convergence order is improved, but also the nonlinear iteration time is reduced remarkably in our method.

In this article we consider the application of Schwarz-type domain decomposition preconditioners to the discontinuous Galerkin finite element approximation of the compressible Navier-Stokes equations. To discretize this system of conservation laws, we exploit the (adjoint consistent) symmetric version of the interior penalty discontinuous Galerkin finite element method. To define the necessary coarse-level solver required for the definition of the proposed preconditioner, we exploit ideas from composite finite element methods, which allow for the definition of finite element schemes on general meshes consisting of polygonal (agglomerated) elements. The practical performance of the proposed preconditioner is demonstrated for a series of viscous test cases in both two- and three-dimensions.

We present in this paper a proof of well-posedness and convergence for the parallelSchwarz Waveform Relaxation Algorithm adapted to an N-dimensional semilinear heatequation. Since the equation we study is an evolution one, each subproblem at each stephas its own local existence time, we then determine a common existence time for everyproblem in any subdomain at any step. We also introduce a new technique: Exponential DecayError Estimates, to prove the convergence of the Schwarz Methods, with multisubdomains,and then apply it to our problem.

Spectral element methods on simplicial meshes, say TSEM, show both the advantages of spectral and finite element methods, i.e., spectral accuracy and geometrical flexibility. We present aTSEM solver of the two-dimensional (2D) incompressible Navier-Stokes equations, with possible extension to the 3D case. It uses a projection method in time and piecewise polynomial basis functions of arbitrary degree in space. The so-called Fekete-Gauss TSEM is employed,i.e., Fekete (resp. Gauss) points of the triangle are used as interpolation (resp. quadrature) points. For the sake of consistency, isoparametric elements are used to approximate curved geometries. The resolution algorithm is based on an efficient Schur complement method, so that one only solves for the element boundary nodes. Moreover, the algebraic system is never assembled, therefore the number of degrees of freedom is not limiting. An accuracy study is carried out and results are provided for classical benchmarks: the driven cavity flow, the flow between eccentric cylinders and the flow past a cylinder.

The propagation of the action potential in the heart chambers is accurately described bythe Bidomain model, which is commonly accepted and used in the specialistic literature.However, its mathematical structure of a degenerate parabolic system entails highcomputational costs in the numerical solution of the associated linear system. Domaindecomposition methods are a natural way to reduce computational costs, and OptimizedSchwarz Methods have proven in the recent years their effectiveness in accelerating theconvergence of such algorithms. The latter are based on interface matching conditions moreefficient than the classical Dirichlet or Neumann ones. In this paper we analyze anOptimized Schwarz approach for the numerical solution of the Bidomain problem. We assessthe convergence of the iterative method by means of Fourier analysis, and we investigatethe parameter optimization in the interface conditions. Numerical results in 2D and 3D aregiven to show the effectiveness of the method.

We propose a new reduced basis element-cum-component mode synthesis approach forparametrized elliptic coercive partial differential equations. In the Offline stage weconstruct a Library of interoperable parametrized reference componentsrelevant to some family of problems; in the Online stage we instantiate andconnect reference components (at ports) to rapidly form and query parametricsystems. The method is based on static condensation at the interdomainlevel, a conforming eigenfunction “port” representation at the interface level, andfinally Reduced Basis (RB) approximation of Finite Element (FE) bubble functions at theintradomain level. We show under suitable hypotheses that the RB Schur complement is closeto the FE Schur complement: we can thus demonstrate the stability of the discreteequations; furthermore, we can develop inexpensive and rigorous (system-level) aposteriori error bounds. We present numerical results for model many-parameterheat transfer and elasticity problems with particular emphasis on the Online stage; wediscuss flexibility, accuracy, computational performance, and also the effectivity of thea posteriori error bounds.

Since matrix compression has paved the way for discretizing the boundary integralequation formulations of electromagnetics scattering on very fine meshes, preconditionersfor the resulting linear systems have become key to efficient simulations. Operatorpreconditioning based on Calderón identities has proved to be a powerful device fordevising preconditioners. However, this is not possible for the usual first-kind boundaryformulations for electromagnetic scattering at general penetrable composite obstacles. Wepropose a new first-kind boundary integral equation formulation following the reasoningemployed in [X. Clayes and R. Hiptmair, Report 2011-45, SAM, ETH Zürich (2011)] foracoustic scattering. We call it multi-trace formulation, because itsunknowns are two pairs of traces on interfaces in the interior of the scatterer. We give acomprehensive analysis culminating in a proof of coercivity, and uniqueness and existenceof solution. We establish a Calderón identity for the multi-trace formulation, which formsthe foundation for operator preconditioning in the case of conforming Galerkin boundaryelement discretization.

We introduce and study a parallel domain decomposition algorithm for the simulation of blood flow in compliant arteries using a fully-coupled system of nonlinear partial differential equations consisting of a linear elasticity equation and the incompressible Navier-Stokes equations with a resistive outflow boundary condition. The system is discretized with a finite element method on unstructured moving meshes and solved by a Newton-Krylov algorithm preconditioned with an overlapping restricted additive Schwarz method. The resistive outflow boundary condition plays an interesting role in the accuracy of the blood flow simulation and we provide a numerical comparison of its accuracy with the standard pressure type boundary condition. We also discuss the parallel performance of the implicit domain decomposition method for solving the fully coupled nonlinear system on a supercomputer with a few hundred processors.

An abstract framework for constructing stable decompositions of the spaces correspondingto general symmetric positive definite problems into “local” subspaces and a global“coarse” space is developed. Particular applications of this abstract framework includepractically important problems in porous media applications such as: the scalar elliptic(pressure) equation and the stream function formulation of its mixed form, Stokes’ andBrinkman’s equations. The constant in the corresponding abstract energy estimate is shownto be robust with respect to mesh parameters as well as the contrast, which is defined asthe ratio of high and low values of the conductivity (or permeability). The derived stabledecomposition allows to construct additive overlapping Schwarz iterative methods withcondition numbers uniformly bounded with respect to the contrast and mesh parameters. Thecoarse spaces are obtained by patching together the eigenfunctions corresponding to thesmallest eigenvalues of certain local problems. A detailed analysis of the abstractsetting is provided. The proposed decomposition builds on a method of Galvis and Efendiev[Multiscale Model. Simul. 8 (2010) 1461–1483] developedfor second order scalar elliptic problems with high contrast. Applications to the finiteelement discretizations of the second order elliptic problem in Galerkin and mixedformulation, the Stokes equations, and Brinkman’s problem are presented. A number ofnumerical experiments for these problems in two spatial dimensions are provided.

A quasi non-overlapping hybrid scheme that combines the finite-difference time-domain (FDTD) method and the finite-element time-domain (FETD) method with nonconforming meshes is developed for time-domain solutions of Maxwell’s equations. The FETD method uses mixed-order basis functions for electric and magnetic fields, while the FDTD method uses the traditional Yee’s grid; the two methods are joined by a buffer zone with the FETD method and the discontinuous Galerkin method is used for the domain decomposition in the FETD subdomains. The main features of this technique is that it allows non-conforming meshes and an arbitrary numbers of FETD and FDTD subdomains. The hybrid method is completely stable for the time steps up to the stability limit for the FDTD method and FETD method. Numerical results demonstrate the validity of this technique.

In this article a variational reduction method, how to handle the case of heterogenousdomains for the Transport equation, is presented. This method allows to get rid of therestrictions on the size of time steps due to the thin parts of the domain. In the thinpart of the domain, only a differential problem, with respect to the space variable, is tobe approximated numerically. Numerical results are presented with a simple example. Thevariational reduction method can be extended to thin domains multi-branching in 3dimensions, which is a work in progress.

The reduced basis element method is a new approach for approximating the solution of problems described by partial differential equations. The method takes its roots in domain decomposition methods and reduced basis discretizations. The basic idea is to first decomposethe computational domain into a series of subdomains that are deformationsof a few reference domains (or generic computational parts). Associated with each reference domain are precomputed solutions corresponding to the same governing partial differential equation,but solved for different choices of deformations of the referencesubdomains and mapped onto the reference shape.The approximation corresponding to a new shape is then taken to be a linear combination of the precomputed solutions, mappedfrom the generic computational part to the actual computational part.We extend earlier work in this direction to solve incompressible fluid flow problems governed by the steady Stokes equations. Particular focus is given to satisfying the inf-sup condition,to a posteriori error estimation, and to “gluing” the local solutions together in the multidomain case.

In this paper, we present extensive numerical tests showing the performanceand robustness of a Balancing Neumann-Neumann method for the solution of algebraic linear systems arising from hp finite element approximations of scalar ellipticproblems on geometrically refined boundary layer meshes inthree dimensions. The numerical results are in good agreement with the theoretical bound for the condition number of the preconditioned operator derived in [Toselli and Vasseur, IMA J. Numer. Anal.24 (2004) 123–156]. They confirm that the condition numbers are independent of theaspect ratio of the mesh and of potentially large jumps of thecoefficients. Good results are also obtained for certain singularly perturbed problems. The condition numbers only grow polylogarithmically with thepolynomial degree, as in the case of p approximations on shape-regular meshes [Pavarino, RAIRO: Modél. Math. Anal. Numér.31 (1997) 471–493]. This paper follows [Toselli and Vasseur, Comput. Methods Appl. Mech. Engrg.192 (2003) 4551–4579] on two dimensional problems.

In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a set of assumptions on the coarse basis functions, to ensure bound for the resulting preconditioned system. These assumptions only involve geometrical quantities associated to the aggregates, namely their diameter and the overlap. A condition number which depends on the product of the relative overlap among the subdomains and the relative overlap among the aggregates is proved. Numerical experiments on a model problem are reported to illustrate the performance of the proposed preconditioners.

Domain decomposition techniques provide a flexible tool for the numerical approximation of partial differential equations. Here, we consider mortar techniques for quadratic finite elements in 3D with different Lagrange multiplier spaces. In particular, we focus on Lagrange multiplier spaces which yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces in case of hexahedral triangulations. As a result, standard efficient iterative solvers as multigrid methods can be easily adapted to the nonconforming situation. We present the discretization errors in different norms for linear and quadratic mortar finite elements with different Lagrange multiplier spaces. Numerical results illustrate the performance of our approach.

We present a domain decomposition theory on an interface problemfor the linear transport equation between a diffusive and a non-diffusive region.To leading order, i.e. up to an error of the order of the mean free path in thediffusive region, the solution in the non-diffusive region is independent of thedensity in the diffusive region. However, the diffusive and the non-diffusive regionsare coupled at the interface at the next order of approximation. In particular, ouralgorithm avoids iterating the diffusion and transport solutions as is done in mostother methods — see for example Bal–Maday (2002). Our analysis is based instead on an accurate description of the boundarylayer at the interface matching the phase-space density of particles leaving thenon-diffusive region to the bulk density that solves the diffusion equation.

In this note, we propose and analyse a method for handlinginterfaces between non-matching grids based on an approachsuggested by Nitsche (1971) for the approximation ofDirichlet boundary conditions. The exposition is limited toself-adjoint elliptic problems, using Poisson's equation as amodel. A priori and a posteriori error estimates are given. Somenumerical results are included.