碘分子吸收光谱研究

我们用HRD-1型双光栅单色仪记录了碘分子在可见光区域的吸收光谱。确定了大量的带头,由此得出了碘分子的离解限、离解能、力常数和振动基频。实验结果与理论结果很符合。     

Muon Spin Rotation and Relaxation Experiments on Thin Films

The recent development at the Paul Scherrer Institute of a beam of low energy muons allows depth dependent muon spin rotation and relaxation investigations in thin samples, multilayers and near surface regions (low energy SR, LE-SR). After a brief overview of the LE-SR method, some representative experiments performed with this technique will be presented. The first direct determination of the field profile just below the surface of a high-temperature superconductor in the Meissner phase illustrates the power and sensitivity of low energy muons as near-surface probe and is an example of general application to depth profiling of magnetic fields. The evolution of the flux line lattice distribution across the surface of a YBa₂Cu₃O₇ film in the vortex phase has been investigated by implanting muons on both sides of a normal-superconducting boundary. A determination of the relaxation time and energy barrier to thermal activation in iron nanoclusters, embedded in a silver thin film matrix (500nm), demonstrates the use of slow muons to measure the properties of samples that cannot be made thick enough for the use of conventional SR. Other experiments investigated the magnetic properties of thin Cr(001) layers at thicknesses above and below the collapse of the spin density wave.     

Convexity and the Average Curvature of Plane Curves

The average curvature of a rectifiable closed curve in R2 is its total absolute curvature divided by its length. If a rectifiable closed curve in R2 is contained in the interior of a convex set D then its average curvature is at least as large as the average curvature of the simple closed curve D which bounds the convex set.     

Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N ³. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.     

Superconvergence of the iterated collocation methods for Hammerstein equations

In this paper, we analyse the iterated collocation method for Hammerstein equations with smooth and weakly singular kernels. The paper expands the study which began in [16] concerning the superconvergence of the iterated Galerkin method for Hammerstein equations. We obtain in this paper a similar superconvergence result for the iterated collocation method for Hammerstein equations. We also discuss the discrete collocation method for weakly singular Hammerstein equations. Some discrete collocation methods for Hammerstein equations with smooth kernels were given previously in [3, 18].     

Variable metric bundle methods: From conceptual to implementable forms

To minimize a convex function, we combine Moreau-Yosida regularizations, quasi-Newton matrices and bundling mechanisms. First we develop conceptual forms using “reversal” quasi-Newton formulae and we state their global and local convergence. Then, to produce implementable versions, we incorporate a bundle strategy together with a “curve-search”. No convergence results are given for the implementable versions; however some numerical illustrations show their good behaviour even for large-scale problems.     

Aspiration Based Simulated Annealing Algorithm

An aspiration based simulated annealing algorithm for continuousvariables has been proposed. The new algorithm is similar to the one givenby Dekkers and Aarts (1991) except that a kind of memory is introduced intothe procedure with a self-regulatory mechanism. The algorithm has beenapplied to a set of standard global optimization problems and a number ofmore difficult, complex, practical problems and its performance comparedwith that of the algorithm of Dekkers and Aarts (1991). The new algorithmappears to offer a useful alternative to some of the currently availablestochastic algorithms for global optimization.     

Solution of monotone complementarity problems with locally Lipschitzian functions

The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ∥ ₂ ² , we extend results which hold for sufficiently smooth functionsF to the nonsmooth case. In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1+p.     

Scattering by randomly oriented thin ice disks with moderate equivalent-sphere size parameters

We use the T-matrix method to compute the scattering matrix for randomly oriented circular ice cylinders with diameter-to-length ratios 1 and 20 and surface-equivalent-sphere size parameters up to 12. We show that wavelength-sized, sharp-edged ice plates with extreme diameter-to-length ratios possess the same scattering properties as smooth platelike spheroids: their phase functions are similar to those of surface-equivalent compact particles, whereas all other elements of the scattering matrix are typical of Rayleigh scattering.     

指派矩阵同解改造理论变换定理论证

本文对指派问题的“周良泽算法”赖以成立而又尚未具体证明的一个重要的基础性定理，给出了严谨的论证，对指派矩阵同解改造理论作了抬遗补证的工作。