Convergence rate estimate for a domain decomposition method

Summary We provide a convergence rate analysis for a variant of the domain decomposition method introduced by Gropp and Keyes for solving the algebraic equations that arise from finite element discretization of nonsymmetric and indefinite elliptic problems with Dirichlet boundary conditions in ². We show that the convergence rate of the preconditioned GMRES method is nearly optimal in the sense that the rate of convergence depends only logarithmically on the mesh size and the number of substructures, if the global coarse mesh is fine enough.This author was supported by the National Science Foundation under contract numbers DCR-8521451 and ECS-8957475, by the IBM Corporation, and by the 3M Company, while in residence at Yale UniversityThis author was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy under Contract W-31-109-Eng-38This author was supported by the National Science Foundation under contract number ECS-8957475, by the IBM Corporation, and by the 3M Company     

Some reactions of ammonium or hydrazinium fluorides with xenon difluoride or xenon hexafluoride

The reactions between ammonium fluoride, hydrazinium(1+) fluoride, hydrazinium(2+) fluoride and XeF₂ or XeF₆ were studied. It was found that Xe, HF, N₂ were formed in these reactions. Interestingly enough, beside of these gases nitrogen fluorides in different quantities were formed also. The courses and the products of the above reactions are compared with analogous reactions with KrF₂.     

A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems

In recent years, competitive domain-decomposed preconditioned iterative techniques of Krylov-Schwarz type have been developed for nonsymmetric linear elliptic systems. Such systems arise when convection-diffusion-reaction problems from computational fluid dynamics or heat and mass transfer are linearized for iterative solution. Through domain decomposition, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow effective solution on parallel machines. A central question is how to choose these small problems and how to arrange the order of their solution. Different specifications of decomposition and solution order lead to a plethora of algorithms possessing complementary advantages and disadvantages. In this report we compare several methods, including the additive Schwarz algorithm, the classical multiplicative Schwarz algorithm, an accelerated multiplicative Schwarz algorithm, the tile algorithm, the CGK algorithm, the CSPD algorithm, and also the popular global ILU-family of preconditioners, on some nonsymmetric or indefinite elliptic model problems discretized by finite difference methods. The preconditioned problems are solved by the unrestarted GMRES method. A version of the accelerated multiplicative Schwarz method is a consistently good performer.     

Recursive mesh refinement on hypercubes

Adaptive methods for PDEs can be viewed as a graph problem. An efficient parallel implementation of adaptive PDE methods then requires distributing the nodes of the associated graph uniformly across the processors so that the resulting cost of communication between processors is low.We solve this problem in two phases: labeling of graph nodes and subsequent mapping of these labels onto processors. We describe a new form of Gray-code which we call aninterleaved Gray-code that allows easy labeling of graph nodes when the maximal level of refinement is unknown, allows easy determination of nearby nodes in the graph, is completely deterministic, and often (in a well-defined sense) distributes the graph uniformly across a hypercube. The theoretical results are supported by computational experiments on the Connection Machine.The work presented in this paper was supported by the Office of Naval Research under contract N00014-85-K-0461, by the Army Research Office under contract DAAL03-86-K-0158, by the Office of Naval Research under contract number N00014-86-K-0310 and the National Science Foundation under contract number DCR 8521451. Part of this work was performed while the second author was in residence at the Computer Science and Systems Division of Harwell Laboratory, United Kingdom.     

General Natural $$(\alpha ,\varepsilon )$$-Structures

We study in a unified way the \((\alpha ,\varepsilon )\)-structures of general natural lift type on the tangent bundle of a Riemannian manifold. We characterize the general natural \(\alpha \)-structures on the total space of the tangent bundle of a Riemannian manifold, and provide their integrability conditions (the base manifold is a space form and some involved coefficients are rational functions of the other ones). Then, we characterize the two classes (with respect to the sign of \(\alpha \varepsilon \)) of \((\alpha ,\varepsilon )\)-structures of general natural type on TM. The class \(\alpha \varepsilon =-1\) is characterized by some proportionality relations between the coefficients of the metric and those of the \(\alpha \)-structure, and in this case, the structure is almost Kählerian if and only if the first proportionality factor is the derivative of the second one. Moreover, the total space of the tangent bundle is a Kähler manifold if and only if it depends on three coefficients only (two coefficients of the integrable \(\alpha \)-structure and a proportionality factor).     

Domain decomposition methods in computational fluid dynamics

The divide-and-conquer paradigm of iterative domain decomposition or substructuring has become a practical tool in computational fluid dynamics applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. We illustrate these features on the classic model problem of flow over a backstep using Newton's method as the non-linear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately and can be combined synergistically. We include sample performance results from an Intel iPSC/860 hypercube implementation.     

Groups acting on tree-graded spaces and splittings of relatively hyperbolic groups

Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut-points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying embeddings of a group into another group, etc. lead to actions of groups on the asymptotic cones, it is natural to consider actions of groups on tree-graded spaces. We develop a theory of such actions which generalizes the well-known theory of groups acting on R-trees. As applications of our theory, we describe, in particular, relatively hyperbolic groups with infinite groups of outer automorphisms, and co-Hopfian relatively hyperbolic groups.     

Riemannian almost product and para-Hermitian cotangent bundles of general natural lift type

We characterize the almost product and locally product structures of general natural lift type on the cotangent bundle of a Riemannian manifold. We find the conditions under which the cotangent bundle endowed with the constructed almost product (locally product) structure and with a pseudo-Riemannian metric obtained as a general natural lift of the metric from the base manifold, is a Riemannian almost product (locally product) or an (almost) para-Hermitian manifold. Finally, by studying the closedness of the 2-form associated to the obtained (almost) para-Hermitian structure, we characterize the general natural (almost) para-Kählerian structures on the cotangent bundle.