Sufficient conditions of non‐uniqueness for the Coulomb friction problem

We consider the Signorini problem with Coulomb friction in elasticity. Sufficient conditions of non‐uniqueness are obtained for the continuous model. These conditions are linked to the existence of real eigenvalues of an operator in a Hilbert space. We prove that, under appropriate conditions, real eigenvalues exist for a non‐local Coulomb friction model. Finite element approximation of the eigenvalue problem is considered and numerical experiments are performed. Copyright © 2003 John Wiley & Sons, Ltd.     

The long‐time behaviour of the thermoconvective flow in a porous medium

For the Boussinesq approximation of the equations of coupled heat and fluid flow in a porous medium we show that the corresponding system of partial differential equations possesses a global attractor. We give lower and upper bounds of the Hausdorff dimension of the attractor depending on a physical parameter of the system, namely the Rayleigh number of the flow. Numerical experiments confirm the theoretical findings and raise new questions on the structure of the solutions of the system. Copyright © 2004 John Wiley & Sons, Ltd.     

Analysis of finite dimensional approximations to a class of partial differential equations

In this paper, a unified approach for analysing finite dimensional approximations to a class of partial differential equations boundary value problems (second‐kind Fredholm differential equations) is introduced. The approach is shown to be general despite of its extremely simple form. In particular, it is expected to be useful in the convergence analysis of finite element methods for solving PDE problems. Three specific examples are presented to illustrate the broad applicability of the approach. Copyright © 2004 John Wiley & Sons, Ltd.     

美式期权定价中非局部问题的有限元方法

在本文中 ,我们关心的是美式期权的有限元方法 .首先 ,根据 [4 ]我们对所讨论的问题引进一个新奇的实用的方法 ,它涉及到对原问题重新形成准确的数学公式 ,使得数值解的计算可以在非常小的区域上进行 ,从而该算法计算速度快精度高 .进而 ,我们利用超逼近分析技术得到了有限元解关于 L2 -模的最优估计 .     

CONVERGENCE OF SOLUTIONS FOR A CLASS OF DIFFERENCE EQUATIONS WITH VARIABLE DELAY

Ｃｏｎｓｉｄｅｒｔｈｅｄｉｆｅｒｅｎｃｅｅｑｕａｔｉｏｎｗｉｔｈａｖａｒｉａｂｌｅｄｅｌａｙｘｎ－ｘｎ－１＝Ｆ（ｘｎ，ｘｒ（ｎ），ｎ＝ｎ０，ｎ０＋１，…（１）ｗｈｅｒｅ（Ｈ１）：Ｆ∈Ｃ（Ｒ×Ｒ，Ｒ），Ｆ（ｕ，ｖ）ｉｓｄｅｃｒｅａｓｉｎｇｗｉｔｈｒｅｓ...     

Combination of mixed finite element and Dirichlet-to-Neumann methods in nonlinear plane elasticity

We study the solvability and Galerkin approximation of an exterior hyperelastic interface problem arising in plane elasticity. The weak formulation is obtained from an appropriate combination of a mixed finite element approach with a Dirichlet-to-Neumann method. The derivation of our results is based on some tools from nonlinear functional analysis and the Babuska-Brezzi theory for variational problems with constraints.     

Adaptive remeshing for ductile fracture prediction in metal formingRemaillage adaptatif pour la prévision de la rupture ductile en mise en forme

The analysis of mechanical structures using the Finite Element Method in the framework of large elastoplastic strain, needs frequent remeshing of the deformed domain during computation. Indeed, the remeshing is due to the large geometrical distortion of finite elements and the adaptation to the physical behavior of the solution. This paper gives the necessary steps to remesh a mechanical structure during large elastoplastic deformations with damage. An important part of this process is constituted by geometrical and physical error estimates. The proposed method is integrated in a computational environment using the ABAQUS/Explicit solver and the BL2D-V2 adaptive mesher. To cite this article: H. Borouchaki et al., C. R. Mecanique 330 (2002) 709–716.     

Montgomery Multiplication in GF(2k)

We show that the multiplication operation c=a · b · r^-1 in the field GF(2^k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2^k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.     

Computation of the quasi-stationary distributions inM(n)/GI/1/K andGI/M(n)/1/K queues

In this paper, we provide numerical means to compute the quasi-stationary (QS) distributions inM/GI/1/K queues with state-dependent arrivals andGI/M/1/K queues with state-dependent services. These queues are described as finite quasi-birth-death processes by approximating the general distributions in terms of phase-type distributions. Then, we reduce the problem of obtaining the QS distribution to determining the Perron-Frobenius eigenvalue of some Hessenberg matrix. Based on these arguments, we develop a numerical algorithm to compute the QS distributions. The doubly-limiting conditional distribution is also obtained by following this approach. Since the results obtained are free of phase-type representations, they are applicable for general distributions. Finally, numerical examples are given to demonstrate the power of our method.