An iterative implementation of the Uzawa algorithm for 3-D fluid flow problems

A new iterative algorithm for the solution of the three-dimensional Navier–Stokes equations by the finite element method is presented. This algorithm is based on a combination of the Uzawa and the Arrow–Hurwicz algorithms and uses a preconditioning technique to enhance convergence. Numerical tests are presented for the cubic cavity problem with two elements, namely the linear brick Q₁?P₀ and the enriched linear brick Q₁⁺ ? P₁. It is shown that the proposed methodology is optimal with the enriched element and that the CPU time varies as NEQ^1·44, where NEQ is the number of equations.     

Fixed point strategies for elastostatic frictional contact problems

Several fixed point strategies and Uzawa algorithms (for classical and augmented Lagrangian formulations) are presented to solve the unilateral contact problem with Coulomb friction. These methods are analysed, without introducing any regularization, and a theoretical comparison is performed. Thanks to a formalism coming from convex analysis, some new fixed point strategies are presented and compared with known methods. The analysis is first performed on continuous Tresca problem and then on the finite dimensional Coulomb problem derived from an arbitrary finite element method. Copyright © 2007 John Wiley & Sons, Ltd.     

Monotone Comparative Statics: Geometric Approach

We consider the comparative statics of solutions to parameterized optimization problems. A geometric method is developed for finding a vector field that, at each point in the parameter space, indicates a direction in which monotone comparative statics obtains. Given such a vector field, we provide sufficient conditions under which the problem can be reparameterized on the parameter space (or a subset thereof) in a way that guarantees monotone comparative statics. A key feature of our method is that it does not require the feasible set to be a lattice and works in the absence of the standard quasi-supermodularity and single-crossing assumptions on the objective function. We illustrate our approach with a variety of applications. We are grateful to Kenneth Arrow, Darrell Duffie, David Luenberger, Paul Milgrom, John Quah, and Pete Veinott for helpful comments. Research in part supported by a David Morgenthaler II Faculty Scholar Award.     

Alternating oblique projections for coupled linear systems

In this work we propose the use of alternating oblique projections (AOP) for the solution of the saddle points systems resulting from the discretization of domain decomposition problems. These systems are called coupled linear systems. The AOP method is a descent method in which the descent direction is defined by using alternating oblique projections onto the search subspaces. We prove that this method is a preconditioned simple gradient (Uzawa) method with a particular preconditioner. Finally, a preconditioned conjugate gradient based version of AOP is proposed. AMS subject classification 65F10, 65N22, 65Y05     

Mixed finite element analysis of semi-coercive unilateral contact problems with given friction

A unilateral contact 2D-problem is considered provided one of two elastic bodies can shift in a given direction as a rigid body. Using Lagrange multipliers for both normal and tangential constraints on the contact interface, we introduce a saddle point problem and prove its unique solvability. We discretize the problem by a standard finite element method and prove a convergence of approximations. We propose a numerical realization on the basis of an auxiliary “ bolted” problem and the algorithm of Uzawa.     

The parameterized complexity of the induced matching problem

Given a graph G and an integer k≥0, the NP-complete Induced Matching problem asks whether there exists an edge subset M of size at least k such that M is a matching and no two edges of M are joined by an edge of G. The complexity of this problem on general graphs, as well as on many restricted graph classes has been studied intensively. However, other than the fact that the problem is W[1]-hard on general graphs, little is known about the parameterized complexity of the problem in restricted graph classes. In this work, we provide first-time fixed-parameter tractability results for planar graphs, bounded-degree graphs, graphs with girth at least six, bipartite graphs, line graphs, and graphs of bounded treewidth. In particular, we give a linear-size problem kernel for planar graphs.     

Preconditioners for higher order edge finite element discretizations of Maxwell's equations

In this paper,we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell's equations.We present the preconditioners for the first family and second family of higher order N′ed′elec element equations,respectively.By combining the stable decompositions of two kinds of edge finite element spaces with the abstract theory of auxiliary space preconditioning,we prove that the corresponding condition numbers of our preconditioners are uniformly bounded on quasi-uniform grids.We also present some numerical experiments to demonstrate the theoretical results.     

Parameterized matching with mismatches

The problem of approximate parameterized string searching consists of finding, for a given text t=t₁t₂…t_n and pattern p=p₁p₂…p_m over respective alphabets Σ_t and Σ_p, the injection π_i from Σ_p to Σ_t maximizing the number of matches between π_i(p) and t_it_i+1…t_i+m−1 (i=1,2,…,n−m+1). We examine the special case where both strings are run-length encoded, and further restrict to the case where one of the alphabets is binary. For this case, we give a construction working in time O(n+(r_p×r_t)α(r_t)log(r_t)), where r_p and r_t denote the number of runs in the corresponding encodings for y and x, respectively, and α is the inverse of the Ackermann's function.     

关于Toeplitz+Hankel线性方程组的迭代解法

本文研究Toeplitz+Hankel线性方程组的预处理迭代解法.我们提出了几个新的预条件子,并分析了预处理矩阵的谱性质,当生成函数在Wiener类中时,预处理矩阵的特征值聚集在1附近.数值实验表明该预处理子比文[5]中的预处理子更有效.