Convergence of algebraic multigrid based on smoothed aggregation

Summary. 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. Received March 1, 1998 / Revised version received January 28, 2000 / Published online: December 19, 2000     

Sequential Convergences on Boolean Algebras Defined by Systems of Maximal Filters

We study sequential convergences defined on a Boolean algebra by systems of maximal filters. We describe the order properties of the system of all such convergences. We introduce the category of 2-generated convergence Boolean algebras and generalize the construction of Novak sequential envelope to such algebras.     

Eisenstein series attached to lattices¶and modular forms on orthogonal groups

We study certain vector valued Eisenstein series on the metaplectic cover of SL₂(ℝ), which transform with the Weil representation associated with the discriminant group of an even lattice L. We find a closed formula for the Fourier coefficients in terms of Dirichlet L-series and representation numbers of L modulo “bad” primes. Such Eisenstein series naturally occur in the context of Borcherds' theory of automorphic products. We indicate some applications to modular forms on the orthogonal group of L with zeros on Heegner divisors. Received: 27 September 2001     

Special functions associated with a certain fourth-order differential equation

We develop a theory of “special functions” associated with a certain fourth-order differential operator D_m,n\mathcal{D}_{\mu,\nu} on ℝ depending on two parameters μ,ν. For integers μ,ν≥−1 with μ+ν∈2ℕ₀, this operator extends to a self-adjoint operator on L ²(ℝ₊,x ^μ+ν+1 dx) with discrete spectrum. We find a closed formula for the generating functions of the eigenfunctions, from which we derive basic properties of the eigenfunctions such as orthogonality, completeness, L ²-norms, integral representations, and various recurrence relations.     

Generalization of the Zlámal condition for simplicial finite elements in ℝ<Superscript><Emphasis Type=Italic>d</Emphasis></Superscript>

The famous Zlámal’s minimum angle condition has been widely used for construction of a regular family of triangulations (containing nondegenerating triangles) as well as in convergence proofs for the finite element method in 2d. In this paper we present and discuss its generalization to simplicial partitions in any space dimension.     

A system-theoretic model for cooperation, interaction and allocation

A system-theoretic approach to cooperation, interaction and allocation is presented that simplifies, unifies and extends the results on classical cooperative games and their generalizations. In particular, a general Weber theory of linear values is obtained and a new theory for local cooperation and general interaction indices is established. The model is dynamic and based on the notion of states of cooperation that change under actions of agents. Careful distinction between “local” states of cooperation and general “system” states leads to a notion of entropy for arbitrary non-negative and efficient allocations and thus to a new information-theoretic criterion for fairness of allocation mechanisms. Shapley allocations, for instance, are exhibited as arising from random walks with maximal entropy. For a large class of cooperation systems, a characterization of game symmetries in terms of λ-values is given. A concept for cores and Weber sets is proposed and it is shown that a Weber set of a game with selection structure always contains the core.     

On the extent of star countable spaces

For a topological property P, we say that a space X is star Pif for every open cover Uof the space X there exists Y ? X such that St(Y,U) = X and Y has P. We consider star countable and star Lindelöf spaces establishing, among other things, that there exists first countable pseudocompact spaces which are not star Lindelöf. We also describe some classes of spaces in which star countability is equivalent to countable extent and show that a star countable space with a dense σ-compact subspace can have arbitrary extent. It is proved that for any ω ₁-monolithic compact space X, if C _p (X)is star countable then it is Lindelöf.     

Shape Optimization for Navier–Stokes Equations with Algebraic Turbulence Model: Numerical Analysis and Computation

We study the shape optimization problem for the paper machine headbox which distributes a mixture of water and wood fibers in the paper making process. The aim is to find a shape which a priori ensures the given velocity profile on the outlet part. The mathematical formulation leads to the optimal control problem in which the control variable is the shape of the domain representing the header, the state problem is represented by the generalized Navier-Stokes system with nontrivial boundary conditions. This paper deals with numerical aspects of the problem.     

Isogeometric structural shape optimization using a fictitious energy regularization

In isogeometric analysis, NURBS basis functions are used as shape functions in an isoparametric finite-element-type discretization. Among other advantageous features, this approach is able to provide exact and smooth representations of a broad class of computational domains with curved boundaries. Therefore, this discretization method seems to be especially convenient for computational shape optimization, where a smooth and CAD-like parametrization of the optimal geometry is desired. Choosing boundary control point coordinates of an isogeometric discretization as design variables, an additional design model can be avoided. However, for a higher number of design variables, typical drawbacks like oscillating boundaries as known from early node-based shape optimization methods appear. To overcome this problem, we propose to use a fictitious energy regularization: the strain energy of a fictitious deformation, which maps the initial to the optimized domain, is employed as a regularizing term in the optimization problem. Moreover, this deformation is used for efficiently moving the dependent nodes within the domain in each step of the optimization process. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)