Persistence of Floquet invariant tori for a class of non-conservative dynamical systems

In this paper we consider a class of non-conservative dynamical system with small perturbation. By the KAM method we prove existence of Floquet invariant tori under the weakest non-resonant conditions.

     

On the Modified Crystalline Stefan Problem with Singular Data

We study the behavior of solutions of the modified Stefan problem in the plane for polygonal interfaces. We are particularly interested in a solution near a singularity of either the loss of a facet or the breaking of a facet. We establish precise regularity results if a facet disappears. We use them to establish the existence of a weak solution with singular data, i.e., when some of the zero-crystalline-curvature facets have zero length.     

脉冲微分方程的上、下解及其在常微分方程上的应用

In this paper, we establish the existence of upper and lower solutions for a periodic boundary value problems (PBVP for short) of impulsive differential equations. which guarantees the existence of at least one solution for the problem. As an application, these results are applied to PBVP of ODE and some examples are given to illustrate our results.     

拟线性椭圆变分不等式的障碍最优控制问题

对拟线性椭圆变分不等式的障碍最优控制问题(即以障碍为控制变量)进行了研究．指标泛函为Lagrange型,其中含有控制变量二阶导数的p次幂,这使得最优性条件的推导颇为不易．对所考虑的问题给出了最优控制的存在性定理以及必要条件．     

关于拟共形映照边界伸缩商的一个注记

本文给出了拟共形映照边界伸缩商与无限小边界伸缩商的一个等式h([μ])=inf_(μ1∈[μ])b([μ1]B)；并给出了一个关于T_0空间的推论．     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

The Hamiltonian Canonical Form for Euler-Lagrange Equations

Based on the theory of calculus of variation, some suffcient conditions are given for some Euler-Lagrangcequations to be equivalently represented by finite or even infinite many Hamiltonian canonical equations. Meanwhile,some further applications for equations such as the KdV equation, MKdV equation, the general linear Euler Lagrangeequation and the cylindric shell equations are given.     

二维光电位置敏感器件的非线性修正

根据二维光电位置敏感器件 (PSD)的工作原理 ,分析了影响PSD线性度的主要因素 ,提出了一种用神经网络对PSD进行非线性修正的方法。以PSD的输入输出数据对作为样本训练的神经网络 ,利用神经网络所具有地能够以任意精度逼近非线性函数的能力 ,实现PSD的输出与实际光点位置之间的映射 ,在神经网络的输出端得到线性响应。该方法的优点是不需要很大的数据存储量即可得到很好的修正效果。结果表明 ,修正后的PSD能在较宽的位置范围内输出高线性度的信号     

RICE CONDITION NUMBERS OF CERTAIN CHARACTERISTIC SUBSPACES

This paper proposes the Rice condition numbers for invariant subspace, singular sub-spaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.