Reissner-Mindlin板的非协调稳定化组合有限元法

基于Reissner-Mindlin板的组合变分格式,提出了一种非协调稳定化组合有限元方法.若有限元空间满足能量协调条件,该方法收敛,并有误差估计.作为应用,讨论了3种有限元空间,并和MITC4和DKQ方法比较.数值结果表明该方法对网格畸变不敏感,若选取适当的参数,在粗网格上就有高精度.     

带变量核的Marcinkiewicz算子交换子在加权Herz空间上的有界性

本文研究了带变量核的Marcinkiewicz算子交换子的有界性问题.利用其在Lp(ω)空间上有界的方法,获得了该交换子在加权Herz空间上有界的结果.     

Riesz空间分数阶对流-扩散方程的一种新型Crank-Nicolson有限体积法

分数阶微分方程作为整数阶微分方程的推广,近年来被广泛应用于科学和工程领域,从而受到越来越多学者的关注.本文提出一种新型Crank-Nicolson有限体积方法求解具有Dirichlet齐次边界的Riesz空间分数阶对流-扩散方程.为了得到Riesz空间分数阶对流-扩散方程的离散格式,在时间层上,利用Crank-Nicolson方法对一阶时间偏导数进行离散.在空间层上,利用有限体积法近似对流项的一阶空间偏导数和扩散项的Riesz空间分数阶偏导数.更进一步,我们也得到了该Crank-Nicolson有限体积离散格式的稳定性和收敛性两个主要理论结果.证明了该离散格式是无条件稳定的,以及在离散L₂-范数下的收敛阶为O(h²+τ²),其中h和τ分别为空间和时间上的步长.最后,通过数值试验验证了该离散格式理论结果的正确性.     

基于Rosenbrock型指数积分的一维间断Galerkin有限元方法

提出基于Rosenbrock型指数积分的一维间断Galerkin有限元方法.该方法在空间上使用间断有限元方法离散,在时间上采用Rosenbrock型指数积分方法.这样不仅可以保持空间离散上的高精度,而且继承了指数时间积分方法具有显式大步长时间推进的优点.数值试验的结果表明,对于一维双曲守恒律问题,这种方法是一种有效的数值算法.     

齐型空间上的Poisson算子与广义Carleson测度

该文在齐型空间上定义了一类广义Carleson测度和Poisson型位势算子，该算子具有与Poisson核相似的性质，研究了该算子在Lp、Hp和Tent空间与Lorentz空间上的有界性.     

具有浓度迁移率和对数势能的粘性Cahn-Hilliard方程的有限元算法

对于具有浓度迁移率和对数势能的粘性Cahn-Hilliard方程,在空间上采用混合有限元方法进行了离散,在时间上采用Crank-Nicolson格式进行了离散.首先,证明了该全离散格式的无条件能量稳定性.其次,详细地证明了H~1空间上的最优误差估计.最后,通过一些算例对所提格式的有效性进行了验证.结果表明,理论分析与数值实验相一致.     

无界区域上波导问题的有效谱迦略金方法(英文)

旨在求解二维无界区域上的波导问题.通过在人工边界施加精确非反射边界条件(nonreflecting boundary condition,NRBC),可以将无界问题截断为有界问题,然后,给出了在空间上用傅里叶谱迦略金方法、时间上用Newmark格式和Richardson外插技巧的数值格式来求解该有界问题.介绍了一个快速的时间行进格式来处理包含在NRBC中的时间方向的卷积.提出的算法在空间和时间上都可以达到高阶精度.另外,也证明了该截断问题的适定性.     

集值映射空间在紧开拓扑下的N性质(英文)

本文研究了点紧连续集值映射族在紧开拓扑下的N性质.利用cs-σ网方法获得了如下结果:若X是N0空间,Y是N空间,则C_k(X,Y)是N空间.该结论将J.A.Guthrie关于单值连续映射空间的结论推广到了集值映射空间上,并且改进了相关结论.     

再生核移位勒让德基函数法求解分数阶微分方程

该文以再生核理论为基础,用移位Legendre多项式作为基函数构造了一个新的再生核空间,并给出了该空间下的再生核函数.与经典的再生核函数有所不同的是该空间下的再生核函数不再是分段函数,因此可以减小分数阶算子作用在核函数上时的计算量,使近似解更为精确.数值算例表明该方法的有效性.     

Fredholm积分算子的均值投影方法

本文介绍了利用区间均值代替区间函数值的离散方法,并证明了由该方法产生的算子为赋范线性空间上的投影算子,且该投影算子具有自伴性且两两不正交性.同时在L~p空间中证明了该投影算子点点收敛于单位算子.进而,本文利用均值投影方法离散Fredholm积分算子,并证明了算法的合理性.     

Planes and processes

This article presented to Combinatorics 2006 is a survey of finite projective planes and the processes used to construct them. All non-translation planes are described, fundamental processes in translation planes are defined and some of these are used to connect semi-field flocks with symplectic spreads. Hermitian ovoids are connected to extensions of derivable nets, and three types of ‘lifting’ methods are discussed. Furthermore, hyperbolic fibrations and ‘regulus-inducing’ central collineation groups are connected to flocks of quadratic cones. Finally, hyper-reguli and multiple hyper-regulus replacement are considered.     

A large deviation analysis of errors in measurement based admission control to buffered and bufferless resources

In measurement based admission control, measured traffic parameters are used to determine the maximum number of connections that can be admitted to a resource within a given quality constraint. The assumption that the measured parameters are the true ones can compromise admission control; measured parameters are random quantities, causing additional variability. This paper analyzes the impact of measurement error within the framework of Large Deviation theory. For a class of admission controls, large deviation principles are established for the number of admitted connections, and for the attained overflow rates. These are applied to admission to bufferless resources, and buffered resources in both the many sources and large buffer asymptotic. The sampling properties of effective bandwidths are presented, together with a discussion the impact of the temporal extent of individual samples on estimator variability. Sample correlations are shown to increase estimator variance; procedures to make admission control robust with respect to these are described.     

Weighted least squares solutions to general coupled Sylvester matrix equations

This paper is concerned with weighted least squares solutions to general coupled Sylvester matrix equations. Gradient based iterative algorithms are proposed to solve this problem. This type of iterative algorithm includes a wide class of iterative algorithms, and two special cases of them are studied in detail in this paper. Necessary and sufficient conditions guaranteeing the convergence of the proposed algorithms are presented. Sufficient conditions that are easy to compute are also given. The optimal step sizes such that the convergence rates of the algorithms, which are properly defined in this paper, are maximized and established. Several special cases of the weighted least squares problem, such as a least squares solution to the coupled Sylvester matrix equations problem, solutions to the general coupled Sylvester matrix equations problem, and a weighted least squares solution to the linear matrix equation problem are simultaneously solved. Several numerical examples are given to illustrate the effectiveness of the proposed algorithms.     

Semi-analytic integration of hypersingular Galerkin BIEs for three-dimensional potential problems

An accurate and efficient semi-analytic integration technique is developed for three-dimensional hypersingular boundary integral equations of potential theory. Investigated in the context of a Galerkin approach, surface integrals are defined as limits to the boundary and linear surface elements are employed to approximate the geometry and field variables on the boundary. In the inner integration procedure, all singular and non-singular integrals over a triangular boundary element are expressed exactly as analytic formulae over the edges of the integration triangle. In the outer integration scheme, closed-form expressions are obtained for the coincident case, wherein the divergent terms are identified explicitly and are shown to cancel with corresponding terms from the edge-adjacent case. The remaining surface integrals, containing only weak singularities, are carried out successfully by use of standard numerical cubatures. Sample problems are included to illustrate the performance and validity of the proposed algorithm.     

The systems approach and fuzzy set theory bridging the gap between mathematical and language-oriented economists

Ideas are presented to show how fuzzy mathematics can be applied in macro-economics in combination with the systems approach in order to bridge the gap between mathematical and language-oriented economists.Two reasons are given.From a mathematical point of view, fuzzy sets, fuzzy relations and fuzzy logic are not fuzzy at all. They are all well defined, but tend to be more complicated than traditional, mathematical concepts used in economics.From a language-oriented economist's point of view, fuzzy sets, etc. are used to express mathematically the type of concepts which are typical in language and most valuable in dealing with complex systems like an economy.The paper deals with economics in general terms, but examples are provided to illustrate the ideas.     

混合位置分布中分量参数的统计推断

对混合位置分布族,当混合比已知时,提出了关于分量参数的假设检验和区间估计方法,所提出的方法基于广义枢轴模型.在一定的条件下,检验的实际水平等于名义水平,且各置信域的实际覆盖率等于名义覆盖率.在更一般的场合,检验是相合的,并且各置信域的实际覆盖率趋于名义覆盖率.模拟显示所给的方法是令人满意的.     

Nonlinear control of systems with multiple equilibria and unknown sinusoidal disturbance

In this paper, nonlinear systems having multiple equilibrium points and low order dynamics are investigated. Roll motions of ships are studied by means of modern nonlinear techniques to exemplify the behavior of such nonlinear systems in the case when they are under the influence of external sinusoidal disturbances with unknown amplitudes. The main objective is to analyze the performance of this system at different operating conditions, including those giving rise to chaos, and to design a controller with an overparameterized structure to stabilize the system at the origin. A nonlinear recursive backstepping controller is proposed and the transient performance is investigated. Lyapunov-based techniques are used to force systematic following of a reference model while introducing a nonlinear parameter estimator to guarantee adaptivity. Robustness problems as well as ways to tune the controller parameters are examined. Simulation results are submitted for the uncontrolled and controlled cases, verifying the effectiveness of the proposed controller. Finally, a discussion and conclusions are given with possible future extensions.     

Capacitated location allocation problem with stochastic location and fuzzy demand: A hybrid algorithm

In this article, a capacitated location allocation problem is considered in which the demands and the locations of the customers are uncertain. The demands are assumed fuzzy, the locations follow a normal probability distribution, and the distances between the locations and the customers are taken Euclidean and squared Euclidean. The fuzzy expected cost programming, the fuzzy β-cost minimization model, and the credibility maximization model are three types of fuzzy programming that are developed to model the problem. Moreover, two closed-form Euclidean and squared Euclidean expressions are used to evaluate the expected distance between customers and facilities. In order to solve the problem at hand, a hybrid intelligent algorithm is applied in which the simplex algorithm, fuzzy simulation, and a modified genetic algorithm are integrated. Finally, in order to illustrate the efficiency of the proposed hybrid algorithm, some numerical examples are presented.     

Progressive censoring from heterogeneous distributions with applications to robustness

Progressively censored order statistics from heterogeneous distributions are introduced and their properties are investigated. After deriving the joint density function, some properties are established. In particular, the case of proportional hazards leads to an interesting connection to the model of generalized order statistics. Finally, the special case of exponential distribution is considered and some known results are generalized to this heterogeneous case, and their implications to robustness are highlighted.     

Scheduling jobs with different,job-dependent earliness and tardiness penalties using the SLK method

The single machine job scheduling problem, where due dates are assigned using the SLK due date determination method, is examined assuming different penalties for the early and tardy jobs. These penalties are assumed to be job-dependent, proportional to the processing times of jobs raised to an integer, non-negative power. The objective function is the total weighted lateness. Several cases are examined and four algorithms providing the optimal sequences for these cases are presented. Examples are given and conclusions are drawn.