Formulation and survey of ALE method in nonlinear solid mechanics

This paper investigates the applicability and accuracy of existing formulation methods in general purpose finite element programs to the finite strain deformation problems. The basic shortcomings in using such programs in these applications are then pointed out and the need for a different type of formulation is discussed. An arbitrary Lagrangian-Eulerian (ALE) method is proposed and a concise survey of ALE formulation is given. A consistent and complete ALE formulation is derived from the virtual work equation transformed to arbitrary computational reference configurations. Differences between the proposed formulations and similar ones in the literature are discussed. The proposed formulation presents a general approach to ALE method. It includes load correction terms and is suitable for rate-dependent and rate-independent material constitutive law. The proposed formulation reduces to both updated Lagrangian and Eulerian formulations as special cases.     

非饱和土壤水流问题的CN有限元格式

首先给出二维非饱和土壤水流问题基于Crank-Nicolson(CN)方法的具有时间二阶精度的半离散化格式,然后直接从CN时间半离散化格式出发,建立具有时间二阶精度的全离散化CN有限元格式,并给出误差估计,最后用数值例子说明全离散化CN有限元格式的优越性.这种方法可以绕开关于空间变量的半离散化格式的讨论,提高时间离散的精度,极大地减少时间方向的迭代步,从而减少实际计算中截断误差的积累,提高计算精度和计算效率.     

Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing

The lift-gas allocation problem with well-separator routing constraints is a mixed-integer nonlinear program of considerable complexity. To this end, a mixed-integer linear formulation (compact) is obtained by piecewise-linearizing the nonlinear curves, using binary variables to express the linearization and routing decisions. A new formulation (integrated) combining the decisions on linearization and routing is developed by using a single binary variable. The structures of both formulations are explored to generate lifted cover cuts. Numerical tests show that the solution of the integrated formulation using cutting-plane generation is faster in spite of having more variables than the compact formulation.     

一类单边约束问题的数值方法

本文分别基于原始变分形式与对偶混合变分形式，对一类单边约束问题进行了数值求解，提出了求解离散对偶混合变分问题的Uzawa型算法，并用数值例子验证了算法的有效性．     

非饱和土壤水流方程的CN广义差分法

首先给出二维非饱和土壤水流方程时间二阶精度的Crank-Nicolson(CN)时间半离散化格式,然后直接从CN时间半离散化格式出发,建立具有时间二阶精度的全离散化CN广义差分格式,并给出误差分析,最后用数值例子验证全离散化CN广义差分格式的优越性.这种方法能提高时间离散的精度,极大地减少时间方向的迭代步,从而减少实际计算中截断误差的积累,提高计算精度和计算效率.而且该方法可以绕开对空间变量的半离散化广义差分格式的讨论,使得理论研究更简便.     

A penalty method for rank minimization problems in symmetric matrices

The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive semidefinite matrices to be complementary. This is a continuous and nonconvex reformulation of the rank minimization problem. We investigate calmness of locally optimal solutions to the SDCMPCC formulation and hence show that any locally optimal solution is a KKT point. We develop a penalty formulation of the problem. We present calmness results for locally optimal solutions to the penalty formulation. We also develop a proximal alternating linearized minimization (PALM) scheme for the penalty formulation, and investigate the incorporation of a momentum term into the algorithm. Computational results are presented.     

A New Formulation for Spanning Trees

Spanning trees are fundamental structures in graph theory. Furthermore, computing them is a central part in many relevant algorithms, used in either practical or theoretical applications. The classical Minimum Spanning Tree problem is solvable in polynomial time but almost all of its variants are NP-Hard. In this paper, a novel polynomial size mixed integer linear programming formulation is introduced for spanning trees. This formulation is based on a new characterization we propose for acyclic graphs. Preliminary computational results show that this formulation is capable of solving small instances of the diameter constrained minimum spanning tree problem. It should be possible to strengthen the formulation to tackle larger instances of that problem. Additionally, our spanning tree formulation may prove to be a more effective model for some related applications.     

Robust empty container repositioning considering foldable containers

Because of the extreme imbalance in intercontinental trade, the repositioning of empty containers creates a significant problem for shipping companies. There are many efforts to reduce the cost of repositioning empty containers, one of which is a foldable container. This paper proposes a robust formulation for the empty container repositioning problem considering foldable containers under demand uncertainty. The robust formulation can be used as a tractable approximation of a multistage stochastic programming formulation which is computationally intractable. Moreover, the robust formulation requires only limited information about the distribution of demand to replicate real-world situations. Computational results show that the proposed formulation performs well in terms of operating costs and there exists a significant cost-saving effect when foldable containers are used in maritime transportation.     

A div-curl formulation of the stokes boundary value problem based on a harmonic representation formula

On a two-dimensional domain, we establish a div-curl formulation for the Stokes Dirichlet boundary value problem. The derivation of this formulation is based on a Harmonic representation formula given by Kratz. Existence and uniqueness of solutions for the div-curl formulation are proved.     

On the variational formulation of a transmission problem for the Biot equations

In this article, a variational formulation for the transmission problem of the fluid–bone interaction is formulated. The formulation is based on a modified Biot system of equations for the cancellous bone together with a boundary integral equation formulation of the pressure in the water. Existence and uniqueness for the weak solution of the interaction problem are established in appropriate Sobolev spaces.     

A kinetic formulation for a model coupling free surface and pressurised flows in closed pipes

The aim of this paper is to present a kinetic formulation of a model for the coupling of transient free surface and pressurised flows. Firstly, we revisit the system of Saint-Venant equations for free surface flow: we state some properties of Saint-Venant equations, we propose a kinetic formulation and we verify that this kinetic formulation leads to a Gibbs equilibrium that minimises (in some general case) an energy and preserves the still water steady state. Secondly, we propose a model for pressurised flows in a Saint-Venant-like conservative formulation. We then propose a kinetic formulation and we verify that this kinetic formulation leads to a Gibbs equilibrium that minimises in any case an energy and preserves the still water steady state. Finally, we propose a dual model that couples these two types of flow.     

二维土壤溶质输运方程的有限体积元格式

本文导出二维的土壤溶质输运方程的有限体积元格式, 并分析其误差.通过数值例子说明, 有限体积元格式比有限元格式稳定.     

A stabilized Crank-Nicolson mixed finite element method for non-stationary parabolized Navier-Stokes equations

In this study, a time semi-discrete Crank-Nicolson (CN) formulation with second-order time accuracy for the non-stationary parabolized Navier-Stokes equations is firstly established. And then, a fully discrete stabilized CN mixed finite element (SCNMFE) formulation based on two local Gauss integrals and parameterfree with the second-order time accuracy is established directly from the time semi-discrete CN formulation. Thus, it could avoid the discussion for semi-discrete SCNMFE formulation with respect to spatial variables and its theoretical analysis becomes very simple. Finaly, the error estimates of SCNMFE solutions are provided.     

A Note on the Set Covering Problem

A previously published work on a ‘probabilistic’ formulation of the set covering problem is discussed. Attention is drawn to the dependence of the feasible locations of facilities on the way the continuous space of incidents is divided into subregions when using either the above formulation or the standard deterministic formulation of the set covering problem.     

Vorticity–velocity-pressure and stream function-vorticity formulations for the Stokes problem

We study the Stokes problem of incompressible fluid dynamics in two and three-dimension spaces, for general bounded domains with smooth boundary. We use the vorticity–velocity-pressure formulation and introduce a new Hilbert space for the vorticity. We develop an abstract mixed formulation that gives a precise variational frame and conducts to a well-posed Stokes problem involving a new velocity–vorticity boundary condition. In the particular case of simply connected bidimensional domains with homogeneous boundary conditions, the link with the classical stream function-vorticity formulation is completely described, and we show that the vorticity–velocity-pressure formulation is a natural mathematical extension of the previous one.     

Multicommodity network flows: The impact of formulation on decomposition

This paper investigates the impact of problem formulation on Dantzig—Wolfe decomposition for the multicommodity network flow problem. These problems are formulated in three ways: origin-destination specific, destination specific, and product specific. The path-based origin-destination specific formulation is equivalent to the tree-based destination specific formulation by a simple transformation. Supersupply and superdemand nodes are appended to the tree-based product specific formulation to create an equivalent path-based product specific formulation. We show that solving the path-based problem formulations by decomposition results in substantially fewer master problem iterations and lower CPU times than by using decomposition on the equivalent tree-based formulations. Computational results on a series of multicommodity network flow problems are presented.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.     

A reduced FE formulation based on POD method for hyperbolic equations

A proper orthogonal decomposition (POD) method was successfully used in the reduced-order modeling of complex systems. In this paper, we extend the applications of POD method, namely, apply POD method to a classical finite element (FE) formulation for second-order hyperbolic equations with real practical applied background, establish a reduced FE formulation with lower dimensions and high enough accuracy, and provide the error estimates between the reduced FE solutions and the classical FE solutions and the implementation of algorithm for solving reduced FE formulation so as to provide scientific theoretic basis for service applications. Some numerical examples illustrate the fact that the results of numerical computation are consistent with theoretical conclusions. Moreover, it is shown that the reduced FE formulation based on POD method is feasible and efficient for solving FE formulation for second-order hyperbolic equations.     

伪双曲方程的新混合有限元方法

构造分析一类二阶伪双曲方程的H1-Galerkin扩展混合有限元方法,该方法采用了扩展混合有限元方法和H1-Galerkin混合有限元方法相结合的技巧.新的格式同时保持了扩展混合有限元方法和H1-Galerkin混合有限元方法的优点.该混合格式与标准的混合格式相比能同时逼近三个变量:未知函数、梯度和流量(系数乘以梯度),并且不必满足LBB相容性条件.     

Continuous Timetabling Problems

A conjecture concerning a continuous formulation of timetabling problems is discussed and an alternative discrete formulation is proposed.