Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

Boundary Value Problems for Ordinary Differential Equations with Deviated Arguments

We discuss differential equations with nonlinear boundary conditions. We formulate sufficient conditions under which problems with deviating arguments have quasisolutions or solutions. To obtain the results, we apply the method of monotone iterations.     

Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems.     

OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem

For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms.     

Convergence analysis of time-point relaxation iterates for linear systems of differential equations

We study convergence properties of time-point relaxation (TR) Runge-Kutta methods for linear systems of ordinary differential equations. TR methods are implemented by decoupling systems in Gauss-Jacobi, Gauss-Seidel and successive overrelaxation modes (continuous-time iterations) and then solving the resulting subsystems by means of continuous extensions of Runge-Kutta (CRK) methods (discretized iterations). By iterating to convergence, these methods tend to the same limit called diagonally split Runge-Kutta (DSRK) method. We prove that TR methods are equivalent to decouple in the same modes the linear algebraic system obtained by applying DSRK limit method. This issue allows us to study the convergence of TR methods by using standard principles of convergence of iterative methods for linear algebraic systems. For a particular problem regions of convergence are plotted.     

脉冲离散效应对光纤中基于交叉相位调制的脉冲压缩的影响

通过数值模拟，分析了脉冲离散效应对单模光纤正群速色区基于暗孤子交叉不相位调制的脉冲压缩的影响，并提出了减轻这种影响的办法，作者发现，即使暗孤子与被压缩脉冲的中心波长相差很小，离散效应对脉冲压缩的影响也很大，离散效应不仅导致脉冲压缩比的减小和压缩后脉冲峰值功率的降低，而且还导致脉冲压缩所需最佳光纤长度的增加以及压缩后的脉冲呈现不对称性，还发现，若采取本文提出了的非同步耦合法，则可以明显地弥补离散效应     

Partially and totally asynchronous algorithms for linear complementarity problems

A unified treatment is given for partially and totally asynchronous parallel successive overrelaxation (SOR) algorithms for the linear complementarity problem. Convergence conditions are established and compared to previous results. Convergence of the partially asynchronous method for the symmetric linear complementarity problem can be guaranteed if the relaxation factor is sufficiently small. Unlike previous results, this relaxation factor interval does not depend explicitly on problem size.This material is based on research supported by the Air Force Office of Scientific Research Grant No. AFOSR-89-0410.The author wishes to thank the referee for pointing out how to improve the bound (12). The same technique can be used to reduce the factorn in Ref. 5, p. 553, to .     

近江牡蛎受精细胞学研究

用醋酸──地衣红染色的方法对近江牡蛎人工授精的卵子减数分裂和受精过程进行了详细的细胞学观察．精子入卵前，卵子处于第一次减数分裂的前期（胚泡期），精子入卵后，胚泡消失，然后进行两次减数分裂，在海水温度为２８．８℃的情况下，授精后３３ｍｉｎ和４５ｍｉｎ，绝大部分受精卵已排出第一极体和第二极体，雄原核可在第一极体排出后及第二极体排出前任何时期内形成，雌雄原核以联合的方式将两组染色体合并，授精后１ｈ，大部分卵子完成第一次卵裂．在２５℃和２６℃授精的情况下，观察到了较多的多精入卵的现象．卵子发育的非同步性现象非常明显．     

An asynchronous high‐speed synchrotron shutter

A high‐repetition‐rate mechanical shutter with asynchronous control and sub‐millisecond operation has been developed and tested for specialist X‐ray systems in the field of medical diagnostics and radiation therapy. Capacitor‐coupled linear voice coil actuators are utilized to achieve opening and closing speeds as fast as 700 µs for an aperture height of 4 mm. The design allows for asynchronous control, permitting slave operation of the shutter, a feature that is distinctly suitable for a number of applications including particle image velocimetry, where high‐frame‐rate operation must be accurately synchronized and triggered by the image acquisition sequence of the detector or timing device. The design and construction of the shutter also makes it ideal, with simple and limited modifications, for applications requiring larger apertures, in particular wide beams as found in many synchrotron beamlines.