Search

We prove nearly uniform convergence bounds for the BPX preconditioner based on smoothed aggregation under the assumption that the mesh is regular. The analysis is based on the fact that under the assumption of regular geometry, the coarse-space basis functions form a system of macroelements. This property tends to be satisfied by the smoothed aggregation bases formed for unstructured meshes. [ABSTRACT FROM AUTHOR]

We combine the adaptive and multilevel approaches to the BDDC and formulate a method which allows an adaptive selection of constraints on each decomposition level. We also present a strategy for the solution of local eigenvalue problems in the adaptive algorithm using the LOBPCG method with a preconditioner based on standard components of the BDDC. The effectiveness of the method is illustrated on several engineering problems. It appears that the Adaptive-Multilevel BDDC algorithm is able to effectively detect troublesome parts on each decomposition level and improve convergence of the method. The developed open-source parallel implementation shows a good scalability as well as applicability to very large problems and core counts. [ABSTRACT FROM AUTHOR]

Convergence of the ensemble Kalman filter in the limit for large ensembles to the Kalman filter is proved. In each step of the filter, convergence of the ensemble sample covariance follows from a weak law of large numbers for exchangeable random variables, the continuous mapping theorem gives convergence in probability of the ensemble members, and L bounds on the ensemble then give L convergence. [ABSTRACT FROM AUTHOR]

The Balancing Domain Decomposition by Constraints (BDDC) method is the most advanced method from the Balancing family of iterative substructuring methods for the solution of large systems of linear algebraic equations arising from discretization of elliptic boundary value problems. In the case of many substructures, solving the coarse problem exactly becomes a bottleneck. Since the coarse problem in BDDC has the same structure as the original problem, it is straightforward to apply the BDDC method recursively to solve the coarse problem only approximately. In this paper, we formulate a new family of abstract Multispace BDDC methods and give condition number bounds from the abstract additive Schwarz preconditioning theory. The Multilevel BDDC is then treated as a special case of the Multispace BDDC and abstract multilevel condition number bounds are given. The abstract bounds yield polylogarithmic condition number bounds for an arbitrary fixed number of levels and scalar elliptic problems discretized by finite elements in two and three spatial dimensions. Numerical experiments confirm the theory. [ABSTRACT FROM AUTHOR]

The ensemble Kalman Filter (EnKF) applied to a simple fire propagation model by a nonlinear convection-diffusion-reaction partial differential equation breaks down because the EnKF creates nonphysical ensemble members with large gradients. A modification of the EnKF is proposed by adding a regularization term that penalizes large gradients. The method is implemented by applying the EnKF formulas twice, with the regularization term as another observation. The regularization step is also interpreted as a shrinkage of the prior distribution. Numerical results are given to illustrate success of the new method. [ABSTRACT FROM AUTHOR]

We prove an abstract convergence estimate for the Algebraic Multigrid Method with prolongator defined by a disaggregation followed by a smoothing. The method input is the problem matrix and a matrix of the zero energy modes of the same problem but with natural boundary conditions. The construction is described in the case of a general elliptic system. The condition number bound increases only as a polynomial of the number of levels, and requires only a uniform weak approximation property for the aggregation operators. This property can be a-priori verified computationally once the aggregates are known. For illustration, it is also verified here for a uniformly elliptic diffusion equations discretized by linear conforming quasiuniform finite elements. Only very weak and natural assumptions on the hierarchy of aggregates are needed. [ABSTRACT FROM AUTHOR]

In the Dual-Primal FETI method, introduced by Farhat et al. [5], the domain is decomposed into non-overlapping subdomains, but the degrees of freedom on crosspoints remain common to all subdomains adjacent to the crosspoint. The continuity of the remaining degrees of freedom on subdomain interfaces is enforced by Lagrange multipliers and all degrees of freedom are eliminated. The resulting dual problem is solved by preconditioned conjugate gradients. We give an algebraic bound on the condition number, assuming only a single inequality in discrete norms, and use the algebraic bound to show that the condition number is bounded by $C(1+\log^2(H/h))$ for both second and fourth order elliptic selfadjoint problems discretized by conforming finite elements, as well as for a wide class of finite elements for the Reissner-Mindlin plate model. [ABSTRACT FROM AUTHOR]

The relaxation method for linear inequalities is studied and new bounds on convergence obtained. An asymptotically tight estimate is given for the case when the inequalities are processed in a cyclical order. An improvement of the estimate by an order of magnitude takes place if strong underrelaxation is used. Bounds on convergence usually involve the so-called condition number of a system of linear inequalities, which we estimate in terms of their coefficient matrix. [ABSTRACT FROM AUTHOR]

A fast iterative method for the solution of large, sparse, symmetric, positive definite linear complementarity problems is presented. The iterations reduce to linear iterations in a neighborhood of the solution if the problem is nondegenerate. The variational setting of the method guarantees global convergence. As an application, we consider a discretization of a Dirichlet obstacle problem by triangular linear finite elements. In contrast to usual iterative methods, the observed rate of convergence does not deteriorate with step size. [ABSTRACT FROM AUTHOR]

We analyze the convergence of a substructuring iterative method with Lagrange multipliers, proposed recently by Farhat and Roux. The method decomposes finite element discretization of an elliptic boundary value problem into Neumann problems on the subdomains plus a coarse problem for the subdomain nullspace components. For linear conforming elements and preconditioning by the Dirichlet problems on the subdomains, we prove the asymptotic bound on the condition number $C (1+\log (H/h))^\gamma$ , $\gamma=2$ or $3$ ,where $h$ is the characteristic element size and $H$ subdomain size. [ABSTRACT FROM AUTHOR]

We study symmetric positive definite linear systems, with a 2-by-2 block matrix preconditioned by inverting directly one of the diagonal blocks and suitably preconditioning the other. Using an approximate version of Young's 'Property A', we show that the condition number of the Schur complement is smaller than the condition number obtained by the block-diagonal preconditioning. We also get bounds on both condition numbers from a strengthened Cauchy inequality. For systems arising from the finite element method, the bounds do not depend on the number of elements and can be obtained from element-by-element computations. The results are applied to the p-version finite element method, where the first block of variables consists of degrees of freedom of a low order. [ABSTRACT FROM AUTHOR]

We describe a unifying framework for multigrid methods and projection-iterative methods for integral equations of the second kind, and for the iterative aggregation method for solving input-output relations. The methods are formulated as iterations combined with a defect correction in a subspace. Convergence proofs use contraction arguments and thus involve the nonlinear case automatically. Some new results are presented. [ABSTRACT FROM AUTHOR]