Asymptotics for thin elastic fibers in unilateral contact

What is the contact condition in a 1D beam-model and is it possible to obtain the frictional moments and forces from the 3D traction? If it is possible does the cross-section of the beams influence these values? These questions motivate to study the dimension reduction of a 3D contact problem for beams. This paper is a continuation of [1]. In [1] the asymptotic dimension reduction of a Robin-type elasticity boundary value problem was presented. In this work the explicit relation between a 3D contact problem and a 3D Robin-type elasticity boundary value problem are established and the 1D equations derived in [1] are interpreted as 1D contact conditions, further some numerical examples are shown. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

二维位势问题的快速多极展开式

快速多极边界元法已经成功地应用于大规模二维三维弹性静力学问题中,有效地减少了计算时间和存储需求.将基于Taylor展式地快速多极边界元法应用到二维位势问题中,提出了二维位势问题地快速多极边界元格式,建立了二维位势问题的快速多极展开式.     

A posteriori estimate and asymptotic partial domain decomposition

The method of asymptotic partial decomposition of a domain aims at replacing a 3D or 2D problem by a hybrid problem 3D???1D; or 2D???1D, where the dimension of the problem decreases in part of the domain. The location of the junction between the heterogeneous problems is asymptotically estimated in certain circumstances, but for numerical simulations it is important to be able to determine the location of the junction accurately. In this article, by reformulating the problem in a mixed formulation context and by using an a posteriori error estimate, we propose an indicator of the error due to a wrong position of the junction. Minimizing this indicator allows us to determine accurately the location of the junction. Some numerical results are presented for a toy problem.     

Approximating three‐dimensional potential problems using the complex variable boundary element method (CVBEM)

In the current research, the primary focus is to extend the CVBEM to solving potential problems in three dimensions (3D). This is achieved by applying the CVBEM to three coupled projections of the 3D problem domain, in 2D planes, and then superimposing the resulting corresponding 2D CVBEM solutions. The new 3D CVBEM technique is also applied towards improving 3D problem approximations, which are based on the usual 3D boundary element method (BEM) techniques, by approximating the 3D BEM residual error. Finally, a technique to extend a 3D problem geometry into higher geometric dimensions is introduced, and a corresponding numeric error reduction technique is advanced for use in superimposing multiple dimension approximations to improve 3D approximations. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 535–560, 2000.     

关于半无限规划的对偶间隙

该文对半无限凸规划（Ｐ）提出了一个对偶问题（Ｄ１），证明了（Ｄ１）与（Ｐ）无对偶间隙当且仅当Ｌａｇｒａｎｇｅ对偶问题（Ｄ）与（Ｐ）之间无对偶间隙，作者还利用方向导数给出一个新的刻划鞍点准则的方法。     

一些类型的数学规划问题的全局最优解

本文对严格单调函数给出了几个凸化和凹化的方法，利用这些方法可将一个严格单调的规划问题转化为一个等价的标准D．C．规划或凹极小问题．本文还对只有一个严格单调的约束的非单调规划问题给出了目标函数的一个凸化和凹化方法，利用这些方法可将只有一个严格单调约束的非单调规划问题转化为一个等价的凹极小问题．再利用已有的关于D．C．规划和凹极小的算法，可以求得原问题的全局最优解．     

点群6一维六方准晶椭圆孔口与半无限裂纹反平面弹性问题的解析解

导出了点群6-维六方准晶反平面弹性问题的控制方程.利用复变方法,给出了点群6-维六方准晶在周期平面内的反平面弹性问题的应力分量以及边界条件的复变表示,通过引入适当的保角变换,研究了点群6-维六方准晶中带有椭圆孔口与半无限裂纹的反平面弹性问题,得到了椭圆孔口问题应力场的解析解,给出了半无限裂纹问题在裂纹尖端处的应力强度因子的解析解.在极限情形下,椭圆孔口转化为Griffith裂纹,并得到该裂纹在裂尖处的应力强度因子的解析解.当点群6-维六方准晶体的对称性增加时,其椭圆孔口与半无限裂纹的反平面弹性问题的解退化为点群6mm-维六方准晶带有椭圆孔口与半无限裂纹的反平面弹性问题的解。     

A Fully Nonlinear Boundary value Problem for the Laplace Equation in Dimension Two

We study the regularity up to the boundary of solutions to the boundary value problem:[math001] in D, ∣?u∣= g on &;pardD, where D is the unit disc. This problem finds its application in the study of geophysical and geomagnetic surveys. If g?C^,[math001](D) and is strictly positive, we prove that uis in the Holder class C1,α(D). An example shows that this is no longer true if g has some zeroes on ?D. In this case u isproved to be of class C¹(D)     

Convexification, Concavification and Monotonization in Global Optimization

We show in this paper that via certain convexification, concavification and monotonization schemes a nonconvex optimization problem over a simplex can be always converted into an equivalent better-structured nonconvex optimization problem, e.g., a concave optimization problem or a D.C. programming problem, thus facilitating the search of a global optimum by using the existing methods in concave minimization and D.C. programming. We first prove that a monotone optimization problem (with a monotone objective function and monotone constraints) can be transformed into a concave minimization problem over a convex set or a D.C. programming problem via pth power transformation. We then prove that a class of nonconvex minimization problems can be always reduced to a monotone optimization problem, thus a concave minimization problem or a D.C. programming problem.     

On the uniqueness of generalized and quasi-regular solutions to equations of mixed type in ℝ<Superscript>3</Superscript>

Some three-dimensional (3D) problems for mixed type equations of first and second kind are studied. For equation of Tricomi type, they are 3D analogs of the Darboux (or Cauchy-Goursat) plane problem. Such type problems for a class of hyperbolic and weakly hyperbolic equations as well as for some hyperbolic-elliptic equations are formulated by M. Protter in 1952. In contrast to the well-posedness of the Darboux problem in the 2D case, the new 3D problems are strongly ill-posed. A similar statement of 3D problem for Keldysh-type equations is also given. For mixed type equations of Tricomi and Keldysh type, we introduce the notion of generalized or quasi-regular solutions and find sufficient conditions for the uniqueness of such solutions to the Protter’s problems. The dependence of lower order terms is also studied.     

A column generation algorithm for the estimation of origin–destination matrices in congested traffic networks

The general problem of estimating origin–destination (O–D) matrices in congested traffic networks is formulated as a mathematical programme with equilibrium constraints, referred to as the demand adjustment problem (DAP). This approach integrates the O–D matrix estimation and the network equilibrium assignment into one process. In this paper, a column generation algorithm for the DAP is presented. This algorithm iteratively solves a deterministic user equilibrium model for a given O–D matrix and a DAP restricted to the previously generated paths, whose solution generates a new O–D trip matrix estimation. The restricted DAP is formulated via a single level optimization problem. The convergence on local minimum of the proposed algorithm requires only the continuity of the link travel cost functions and the gauges used in the definition of the DAP.     

An Eigenvalue Problem on Negatively Curved Manifolds

Consider the eigenvalue problem: Δgu - λKu = 0 \quad in D where D is the unit disc of the complex plane, g is a complete metric conformal to the Poincaré metric on D, and K is the Gaussian curvature. It is shown that if λ > \frac{1}{2} (λ > \frac{1}{4}in the case of K ≤ 0), then the above problem has no positive solutions.     

Estimation of Transit Origin–Destination Matrices from Passenger Counts Using a Frequency-Based Approach

This paper investigates the transit passenger origin–destination (O–D) estimation problem in congested transit networks where updated passenger counts and outdated O–D matrices are available. The bi-level programming approach is used for the transit passenger O–D estimation problem. The upper level minimizes the sum of error measurements in passenger counts and O–D matrices, and the lower level is a new frequency-based stochastic user equilibrium (SUE) assignment model that can determine simultaneously the passenger overload delays and passenger route choices in congested transit network together with the resultant transit line frequencies. The lower-level problem can be formulated as either a logit-type or probit-type SUE transit assignment problem. A heuristic solution algorithm is developed for solving the proposed bi-level programming model which is applicable to congested transit networks. Finally, a case study on a simplified transit network connecting Kowloon urban area and the Hong Kong International Airport is provided to illustrate the applications of the proposed bi-level programming model and solution algorithm. This revised version was published online in July 2006 with corrections to the Cover Date.     

Regularity of the 3D Navier–Stokes equations with viewpoint of 2D flow

The regularity of 2D Navier–Stokes flow is well known. In this article we study the relationship of 3D and 2D flow, and the regularity of the 3D Naiver–Stokes equations with viewpoint of 2D equations. We consider the problem in the Cartesian and in the cylindrical coordinates.     

Initial value problems for creeping flow of Maxwell fluids

We consider the flow of nonlinear Maxwell fluids in the unsteady quasistatic case, where the effect of inertia is neglected. We study the well-posedness of the resulting PDE initial-boundary value problem locally in time. This well-posedness depends on the unique solvability of an elliptic boundary value problem. We first present results for the 3D case with sufficiently small initial data and for a simple shear flow problem with arbitrary initial data; after that we extend our results to some 3D flow problems with large initial data.We solve our problem using an iteration between linear subproblems. The limit of the iteration provides the solution of our original problem.     

Sharp regularity theory for thermo-elastic mixed problems 1

We give a sharp (optimal) regularity theory of thermo-elastic mixed problems. Our approach is by P.D.E. methods and applies to any space dimension and, in principle, to any set of boundary conditions. We consider two sets of boundary conditions: hinged and clamped B.C. The original coupled P.D.E. system is split into two suitable uncoupled P.D.E. equations: a Kirchoff mixed problem and a heat equation, whose delicate, optimal regularity is available in the literature. Ultimately, the original problem with boundary non-homogeneous term is reduced to the same problem, however, with homogeneou B.C. and a known ‘right-hand term’ in the equation, which is easier to analyze.     

无向路图和块图上的混合控制

图G=(V,E)的一个混合控制集是一个满足如下条件的集合DV∪E:不在D中的每个点或每条边都相邻或关联于D中的至少一个点或一条边.确定图的最小基数的混合控制集的问题称为混合控制问题.本文研究混合控制问题的算法复杂性,证明了混合控制问题在无向路图上是NP-完全的,但在块图上有线性时间算法.无向路图和块图都是弦图的子类,又是树的母类.     

非光滑泛函临界点理论的一个应用

本文利用局部Lipschitz泛函的临界点理论，来得到一个改进的半线性方程的Landesman Lazer型结果，问题来自于力学，称为变分不等式的特征值问题，在[3]中，D.Goeleven,D.Motreanu和P.D.Panagiotopoulos等人讨论了共振的情形，并得到了弱解的存在性的结果。但是，在他们结论中（见[3]中定理4．1），条件（H1）与（H2）却是互不相容的，本文得到了变分不等式的特征值问题在共振情形下的弱解存在性的相应结果。     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

自由来流湍流与三维壁面局部粗糙诱导平板边界层不稳定T-S波的数值研究

采用直接数值模拟（DNS）方法,研究了在自由来流湍流与三维壁面局部粗糙作用下平板边界层内诱导产生不稳定T-S波的物理问题.数值结果可知,在平板边界层内发现了二维和三维T-S波组成的波包空间序列以及求得了波包向前传播的群速度大小,从而证明了自由来流湍流与三维壁面局部粗糙作用是激励平板边界层内诱导产生不稳定T-S波的一种机制.随后,建立了平板边界层内被激发的二维和三维T S波的初始幅值与自由来流湍流度,三维壁面局部粗糙的流向长度、展向宽度及法向高度之间的关系.这一问题的深入研究,进一步完善了流动稳定性与湍流理论.