ℋ︁‐LU factorization in preconditioners for augmented Lagrangian and grad‐div stabilized saddle point systems

The (mixed finite element) discretization of the linearized Navier–Stokes equations leads to a linear system of equations of saddle point type. The iterative solution of this linear system requires the construction of suitable preconditioners, especially in the case of high Reynolds numbers. In the past, a stabilizing approach has been suggested which does not change the exact solution but influences the accuracy of the discrete solution as well as the effectiveness of iterative solvers. This stabilization technique can be performed on the continuous side before the discretization, where it is known as ‘grad‐div’ (GD) stabilization, as well as on the discrete side where it is known as an ‘augmented Lagrangian’ (AL) technique (and does not change the discrete solution). In this paper, we study the applicability of ??‐LU factorizations to solve the arising subproblems in the different variants of stabilized saddle point systems. We consider both the saddle point systems that arise from the stabilization in the continuous as well as on the discrete setting. Recently, a modified AL preconditioner has been proposed for the system resulting from the discrete stabilization. We provide a straightforward generalization of this approach to the GD stabilization. We conclude the paper with numerical tests for a variety of problems to illustrate the behavior of the considered preconditioners as well as the suitability of ??‐LU factorization in the preconditioners. Copyright © 2010 John Wiley & Sons, Ltd.     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

置换杨图的组合性质及其应用

置换杨图本质上是A.Postnikov在研究完全非负Grassnann元胞及其元胞分解时所定义的]-图(]-diagram)的一个子集.它的发现引起许多组合学者的关注和研究,其中L.K.Williams和E.Steingrí-sson是最先关注这类组合结构的,他们在研究它的组合性质时发现了它与置换群之间存在着一一对应关系Ψ.从置换杨图本身的结构出发按照行递归的方式给出了Ψ是一一映射的一个新方法,利用这种方法可简单地将任意的一个排列π∈Sn分解成若干圈的乘积形式,并且每个圈中的元素都是按递减顺序排列.     

Carlsson's rank conjecture and a conjecture on square-zero upper triangular matrices

Let k be an algebraically closed field and A the polynomial algebra in r variables with coefficients in k. In case the characteristic of k is 2, Carlsson [9] conjectured that for any DG-A-module M of dimension N as a free A-module, if the homology of M is nontrivial and finite dimensional as a k-vector space, then $2^r\le N$. Here we state a stronger conjecture about varieties of square-zero upper triangular $N\times N$ matrices with entries in A. Using stratifications of these varieties via Borel orbits, we show that the stronger conjecture holds when $N<8$ or $r<3$ without any restriction on the characteristic of k. As a consequence, we obtain a new proof for many of the known cases of Carlsson's conjecture and give new results when $N>4$ and $r=2$.