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 -模的最优估计 .     

金纳米粒子光学性质中的尺寸和形状效应

纳米尺度的金属及半导体呈现出特殊的光学、电学及磁学性质,采用近年发展起来的离散偶极近似(DDA)的方法,我们分析了金纳米粒子的尺寸及形状对其光学性质的影响。粒子周围介质的影响在文中亦作了分析。计算结果显示,金纳米粒子的等离子体吸收带同时受到粒子尺寸和形状的影响,但来自形状的影响更为明显。与米氏理论及扩展的甘氏理论相比较,DDA方法在粒子尺寸不再远小于入射光波长的时候更准确,并能应用于任何形状的纳米粒子。理论计算与实验结果能较好的吻合。     

单调全局最优化问题的凸化外逼近算法

单调优化是指目标函数与约束函数均为单调函数的全局优化问题．本文提出一种新的凸化变换方法把单调函数化为凸函数，进而把单调优化问题化为等价的凸极大或凹极小问题，然后采用Hoffman的外逼近方法来求得问题的全局最优解．我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较，通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法．     

Krylov subspaces and the analytic grade

Typical behaviour of the solution of a linear system of equations obtained iteratively by Krylov methods can be characterized by three stages. Initially the residual diminishes steadily; this is followed by stagnation and finally rapid convergence near the algebraic grade. This study examines this behaviour in terms of the concepts of approximately invariant subspace and what we have called the analytic grade of a Krylov sequence. It is shown how the small Ritz values play a vital role in the convergence and how this knowledge helps in the construction of an effective preconditioner. Copyright © 2004 John Wiley & Sons, Ltd.     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.