Robin型离散Schwarz波形松弛算法的收敛性分析

Schwarz波形松弛(Schwarz waveform relaxation,SWR)是一种新型区域分解算法,是当今并行计算研究领域的焦点之一,但针对该算法的收敛性分析基本上都停留在时空连续层面.从实际计算角度看,分析离散SWR算法的收敛性更重要.本文考虑SWR研究领域中非常流行的Robin型人工边界条件,分析时空离散参数t和x、模型参数等因素对算法收敛速度的影响.Robin型人工边界条件中含有一个自由参数p,可以用来优化算法的收敛速度,但最优参数的选取却需要求解一个非常复杂的极小-极大问题.本文对该极小-极大问题进行深入分析,给出最优参数的计算方法.本文给出的数值实验结果表明所获最优参数具有以下优点:(1)相比连续情形下所获最优参数,利用离散情形下获得的参数可以进一步提高Robin型SWR算法在实际计算中的收敛速度,当固定t或x而令另一个趋于零时,利用离散情形下所获参数可以使算法的收敛速度具有鲁棒性(即收敛速度不随离散参数的减小而持续变慢).(2)相比连续情形下所获收敛速度估计,离散情形下获得的收敛速度估计可以更加准确地预测算法的实际收敛速度.     

参数弱向量平衡问题解集的似Holder性和相依导数

本文研究了一类参数弱向量平衡问题解集的似Hölder性和相依导数. 首先, 讨论了该问题的一类实值间隙函数的Lipschitz连续性和Hadamard方向可微性. 然后, 借助这些性质, 建立了该问题解集的似Hölder性和Hölder连续性以及相依导数的具体表达式.     

常微分方程近似解的LS-SVM改进求法

提出一种基于最小二乘支持向量机(LS-SVMs)的求解常微分方程近似解的改进方法.该方法首先通过离散计算域,将常微分方程转换为有约束条件的目标优化问题,然后利用径向基(RBF)核函数可导的性质,用带有导数形式的LS-SVM模型将此优化问题转化为LS-SVM回归问题,进而进行求解.最终得到的闭式近似解具有精度高、连续可微、结构简单且形式固定的特点.该方法适用于任意阶非刚性和奇异的线性常微分方程初值问题和边值问题,以及一阶非线性常微分方程问题.仿真结果验证了该方法具有良好的有效性.     

有序Banach空间中非线性二阶周期边值问题的正解

讨论了有序Banach空间E中的非线性二阶周期边值问题-u″(t)+bu′(t)+cu(t)=f(t,u(t)),0≤t ≤ ω,u(0)=u(ω),u′(0)=u′(ω)正解的存在性,其中b,c∈R且c＞0,f:[0,ω]×P→P连续,P为E中的正元锥.本文通过新的非紧性测度的估计技巧与凝聚映射的不动点指数理论,获得了该问题正解的存在性结果.     

Alternative approach to the optimality of the threshold strategy for spectrally negative Lévy processes

Consider the optimal dividend problem for an insurance company whose uncontrolled surplus precess evolves as a spectrally negative Levy process. We assume that dividends are paid to the shareholders according to admissible strategies whose dividend rate is bounded by a constant. The objective is to find a dividend policy so as to maximize the expected discounted value of dividends which are paid to the shareholders until the company is ruined. In this paper, we show that a threshold strategy （also called refraction strategy） forms an optimal strategy under the condition that the Levy measure has a completely monotone density.     

Compact formulations of the Steiner Traveling Salesman Problem and related problems

The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable when routing on real-life road networks. The standard integer programming formulations of both the TSP and STSP have an exponential number of constraints. On the other hand, several compact formulations of the TSP, i.e., formulations of polynomial size, are known. In this paper, we adapt some of them to the STSP, and compare them both theoretically and computationally. It turns out that, just by putting the best of the formulations into the CPLEX branch-and-bound solver, one can solve instances with over 200 nodes. We also briefly discuss the adaptation of our formulations to some related problems.     

复合材料特征值的高阶多尺度Rayleigh商校正

本文讨论了周期结构复合材料特征值的多尺度计算,提出了高阶多尺度Rayleigh商校正算法,并给出了收敛性分析. 最后,通过大量数值实验结果表明,新算法是有效且必要的.     

General auxiliary problem and algorithm for a generalized multi-valued variational-like inequality problem in reflexive Banach spaces

In this article, some generalized multi-valued variational-like inequality problems and their related general auxiliary problems in real reflexive Banach spaces are introduced. An existence theorem for one of the general auxiliary problems is proved. Furthermore, by exploiting this theorem, an algorithm for the corresponding generalized multi-valued variational-like inequality problem is constructed. The theorems of this article generalize, improve and unify many known corresponding results.     

A non-stationary problem coupling PDEs and ODEs modelizing an automotive catalytic converter

In this article we prove the existence and uniqueness of the solution of a non-stationary problem that modelizes the behavior of the concentrations and the temperature of gases going through a cylindrical passage of an automotive catalytic converter. This problem couples parabolic partial differential equations (PDEs) in a domain with one parabolic partial differential equation and some ordinary differential equations (ODEs) on a part of its boundary.