矩阵方程AXB=D的最小二乘Hermite解及其加权最佳逼近

本中,我们讨论了矩阵方程AXB=D的最小二乘Hermite解,通过运用广义奇异值分解(GSVD)，获得了解的通式。此外,对于给定矩阵F，也得到了它的加权最佳逼近表达式。     

On the structure of the optimal server control for fluid networks

This paper derives the optimal trajectories in a general fluid network with server control. The stationary optimal policy in the complete state space is constructed. The optimal policy is constant on polyhedral convex cones. An algorithm is derived that computes these cones and the optimal policy. Generalized Klimov indices are introduced, they are used for characterizing myopic and time-uniformly optimal policies.Received: November 2004 / Revised: February 2005The research of this author has been supported by the project ‘‘Stochastic Networks’’ of the Netherlands Organisation for Scientific Research NWO.     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

应用自动微分的Newton-PCG算法

一类新的使用符号微分的Newton-PCG型算法在文献[1]和[2]被导出来了。本文建立和研究应用自动微分的相应的Newton-PCG算法，理论分析和数值实验结果显示应用自动微分之后，目标函数的维数或复杂性越大，Newton-PCG算法对Newton法的改进越显著。     

An improved numerical simulator for multiphase flow in porous media

In basin modelling the thermodynamics of a multicomponent multiphase fluid flux are computationally too expensive when derived from an equation of state and the Gibbs equality constraints. In this article we present a novel implicit molar mass formulation technique using binary mixture thermodynamics. The two proposed solution methods, with and without cross derivative terms between components, are based on a preconditioned Newton‐GMRES scheme for each time‐step with analytical computation of the derivatives. These new algorithms reduce significantly the numerical effort for the computation of the molar masses, and we illustrate the behavior of these methods with numerical computations. Copyright © 2004 John Wiley & Sons Ltd.     

Theoretical Study on the Long-lived Complexes for the Na＋I2 Collision System

For the Na I2 collision system, theoretical study is performed on the QCISD(T) level by using ab initio method. The ab initio potential energy surfaces are got and on them the long-lived complexes are found and optimized. These results verify the crossed molecule beam experimental phenomenon and the detailed geometry structures are given for the first time. The role of the complexes in the reaction path is also described in detail.     

The Best Lower Bound for the Permanent of a Correlation Matrix of Rank Two

If 1≤k≤n, then Cor(n,k) denotes the set of all n×n real correlation matrices of rank not exceeding k. Grone and Pierce have shown that if A∈Cor (n, n-1), then per(A)≥n/(n-1). We show that if A∈Cor(n,2), then , and that this inequality is the best possible.     

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.     

具有奇异值分解性质的代数

设F为一个域,R为一个带有对合的F-代数,如果R上每一个矩阵都有奇异值分解(简称SVD),则称R为一个有SVD性质的F-代数.本文指出:R为一个有SVD性质的F-代数的充要条件是:R同构于R~+,或R~+上二次扩域,或R~+上四元数体((-1,-1)/R~+),其中R~+为R的对称元集合,并且R~+为一个Galois序闭域.