概率约束随机规划的一种近似方法及其它的有效解模式

根据最小风险的投资最优问题，我们给出了一个统一的概率约束随机规划模型。随后我们提出了求解这类概率约束随机规划的一种近似算法，并在一定的条件下证明了算法的收敛性。此外，提出了这种具有概率约束多目标随机规划问题的一种有效解模型。     

The Thermal Conductivity Theory of Non-uniform Granular Flow and the Mechanism Analysis

According to the fractal characteristics appearing in non-uniform granular system, we found the fractalmodel to study the effective thermal conductivity in the mixed system. Considering the quasi-equilibrium, we bringforward the fractal velocity probability distribution function. The equipartition of energy is employed to the non-uniform granular system, and the granular temperature is derived. We investigate the thermal conductivity in granularflow due to the movement of the particles, namely the heat transfer induced by the streaming mode only. The thermalconductivity in the mixed system changes with the fractal parameters such as the solid fraction v, structural characterparameter η, and fractal dimension D of size distribution. These parameters depict the characteristics of the thermalconductivity in the actual complex granular system. Comparing our conclusion with the correlative experimental dataand the theoretical conclusion of binary mixture of granular materials, the results can qualitatively confirm the generalityof our prediction on the granular system.     

线性空间中集值映射向量优化问题的最优性条件与Lagrangian乘子

本文在广义次似凸性假设下,利用择一性定理,在线性空间中获得了含等式与不等式约式集值向量最优化问题的Kuhn-Tucker型最优性条件及Lagrangian乘子定理。     

连续线性泛函序列收敛的几何特征

在本文中,我们证明下述主要结果：并简化了文献［１］中的有关结果     

ON DISCRETE PROJECTION AND NUMERICAL BOUNDARY CONDITIONS FOR THE NUMERICAL SOLUTION OF THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS

1. IntroductionLet us consider the unsteady incompressible Navier--Stokes equations (INSE)on a two--dimensional rectangular region fl with boundary 0fl. Here w = (u, v)" is tl1e velocityvector, p is the pressure, and f a known vector function of x) y, and…     

Block Based Bivariate Blending Rational Interpolation via Symmetric Branched Continued Fractions

This paper constructs a new kind of block based bivariate blending rational interpolation via symmetric branched continued fractions. The construction process may be outlined as follows. The first step is to divide the original set of support points into some subsets (blocks). Then construct each block by using symmetric branched continued fraction. Finally assemble these blocks by Newton’s method to shape the whole interpolation scheme. Our new method offers many flexible bivariate blending rational interpolation schemes which include the classical bivariate Newton’s polynomial interpolation and symmetric branched continued fraction interpolation as its special cases. The block based bivariate blending rational interpolation is in fact a kind of tradeoff between the purely linear interpolation and the purely nonlinear interpolation. Finally, numerical examples are given to show the effectiveness of the proposed method.     

乘子方法中的参数选择

Di Pillo和Grippo提出的含参数C〉0的增广Lagrangian函数中，使用了最大函数，该函数可能在无穷多个点处不可微．为了克服这个问题，濮定国在2004年提出了一类带新的NCP函数的乘子法．该方法在增广Lagrangian函数和原问题之间存在很好的等价性；同时该方法具有全局收敛性，且在适当假设下，具有超线性收敛率．但是在该方法中，要求参数C充分大．为了实现算法及提高算法效率，本文给出了一个有效选择参数C的方法．     

THE HAUSDORFF DIMENSION AND MEASURE IN GENERALIZED GEOMETRIC GRAPH DIRECTED CONSTRUCTION

1GeneralizedGeometricGraphDirectedContructionAgenera1izedgeometricgraphdirectedconstructioninR"consistof(1)afinitesequence0fnonoverlapping,compactsubsetsofRm:J1,J2,''tJn.SuchthateachJihasanonemptyinterior,(2)adirectedgeaPh{G}withvertexsetconsistingoftheintegers1,'',n,andsiAn-laritymapsTf?)ofR".where(i,j)EG,withratiost::),suchthat(a)foreachi,1Si5n.thereissomejsuchthat(i,j)EG.(b)foreachi,{ri:)(J,)I(i,i)EG}isanon0verlappingfandlyand(c)ifthepathc0mponentofGr0tedattheyertexi1isacycIe:Fo…     

单障碍问题区域分解法的单调收敛性与收敛速度估计

本文我们考虑一类典型的椭圆型算子的障碍问题的区域分解算法,分析算法的单调收敛性并给出相应的收敛速度估计.障碍问题有着重要的物理背景（参见[3,9]）.近些年来,有关障碍问题的区域分解法方面的研究已经有一些成果.关于线性算子情形,读者可参看[1,2,5,7,8,10,12,13,14,15,17]等文献,而对于非线性算子情形,读者可参看[4,6,16,18].在这些文献中,已经有部分涉及到算法的收敛速度估计.例如,文[15,16]给出了有限元区域分解算法的迭代误差的渐近最大模估计,文[13]给出了求解具M-阵的有限维互补问题     

Generalized projective synchronization of fractional-order complex networks with nonidentical nodes

<正>This paper investigates the synchronization problem of fractional-order complex networks with nonidentical nodes. The generalized projective synchronization criterion of fractional-order complex networks with order 0 < q < 1 is obtained based on the stability theory of the fractional-order system.The control method which combines active control with pinning control is then suggested to obtain the controllers.Furthermore,the adaptive strategy is applied to tune the control gains and coupling strength.Corresponding numerical simulations are performed to verify and illustrate the theoretical results.