Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

水斗非定常自由水膜流三维贴体数值模拟

本研究采用水斗三维非正交贴体坐标系进行了非定常自由水膜流动的数值解析。对不规则水斗内表面采用三维非正交贴体坐标系下离散点进行拟合,推导了曲面离散点的法向矢量和曲面微元面高斯曲率、平均曲率等几何特征量的计算公式,进而导出流体粒子在运动方向上曲率计算式。在水斗三维贴体坐标系中,还推导了流体粒子在水斗曲面上的运动控制方程。最后对某水轮机水斗内表面非定常自由水膜流进行了数值模拟,得到其非定常水膜流态分布。     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.     

半导体激光器光束准直系统的功率耦合效率

在长距离无线光通信中，接收点光功率密度与光束发散角平方呈反比关系，为了获得小的发散角和大的功率耦合效率，要求准直系统有较大的数值孔径(NA)，但数值孔径过大会增加像差，因此合理设计功率耦合效率与准直系统的数值孔径就非常重要。该文对半导体激光器光束准直系统中功率耦合效率进行了研究，给出了半导体激光器光束功率耦合效率与k(孔径半径与孔径处等效光束半径之比)的关系表达式，并结合激光器光束准直系统，给出了半导体激光器光束功率耦合效率与准直系统数值孔径的关系表达式。该研究结论对于半导体激光器光束准直系统设计具有参考作用。     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Simulation of the Action of a Permeable Barrier on an Ideal Incompressible Channel Flow

Plane ideal incompressible flow in a rectangular channel partitioned by a thin permeable barrier (lattice) is considered. In flowing through the lattice the stream suddenly (jumpwise) changes direction and loses energy. The flow is assumed to be vortical; the vorticity is discontinuous on the lattice. A mathematical formulation of the problem for the stream function is proposed in the form of a nonlinear elliptic equation with coefficients discontinuous on the lattice line. A numerical solution is constructed using the finite-element iteration method. The results of the numerical simulation show how the flow velocity profile in the channel can be controlled by means of permeable barriers.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.