Vibrational spectra of (NH4)3ZnCl5

IR and Raman spectra of (NH₄)₃ZnCl₅ have been recorded. The observed spectra have been analysed on the basis of the vibrations of ZnCl ₄ ²⁻ and NH ₄ ⁺ ions. The appearance of multiple Raman bands indicates the presence of two different types of ammonium ions. The effect of anisotropic crystalline field over the ZnCl₄ and NH₄ tetrahedra is also discussed. The assignment of internal modes has been verified by the potential energy distribution calculations.     

Generalized indices of operators inB(H)

A generalized dimension is further developed. Here subtraction and addition of two generalized dimensions are defined, so that the operations: ∞ ± n = ∞, ∞ + ∞ = ∞, which used to play an inflexible role, are refined and moreover, ∞ - ∞, which used to be meaningless, is done in sense. Then generalized index for semi-Fred-holm operators is developed to wholeB(H), i.e. all of bounded linear operators in Hilbert spaceH. Theorem 2.2 is proved with an example, which is in contradiction to a known proposition for semi-Fredholm operators in form, practically a refined result of the known proposition. Then, it is proved thatB(H) is the union of countably many disjoint arewise connected sets over all the generalized dimensions ofB(H). Project supported by the National Natural Science Foundation of China     

Differential–algebraic equations in multibody system modeling

Numerical methods for the efficient integration of both stiff and nonstiff equations of motion of multibody systems having the form of differential-algebraic equations (DAE) of index 3 are discussed. Linear multi-step ABM and BDF methods are considered for the non-iterational integration of nonstiff DAE. The Park method is proposed for integration of stiff equations. This revised version was published online in June 2006 with corrections to the Cover Date.     

Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems

In this paper, we compare two strategies for constructing linear programmingrelaxations for polynomial programming problems using aReformulation-Linearization Technique (RLT). RLT involves an automaticreformulation of the problem via the addition of certain nonlinear impliedconstraints that are generated by using the products of the simple boundingrestrictions (among other products), and a subsequent linearization based onvariable redefinitions. We prove that applying RLT directly to the originalpolynomial program produces a bound that dominates in the sense of being atleast as tight as the value obtained when RLT is applied to the jointcollection of all equivalent quadratic problems that could be constructed byrecursively defining additional variables as suggested by Shor.     

A discontinuous Galerkin method/HLLC solver for the Euler equations

This paper proposes a fully three‐dimensional non‐linear Euler methodology for solving aerodynamic and acoustic problems in the presence of strong shocks and rarefactions. It uses a discontinuous Galerkin method (DGM) within the element, and a Riemann solver (HLLC) at the boundaries to propagate rarefactions while preserving the entropy condition and capturing shocks with no spurious oscillations. This approach is thought to marry the best aspects of finite element and finite volume methods, achieving conservation while not requiring the solution of a large matrix. Examples in which shock and rarefaction waves are well captured are presented and the propagation of acoustic pulses is well demonstrated. Copyright © 2003 John Wiley & Sons, Ltd.     

The numerical approximation of center manifolds in Hamiltonian systems

In this paper we develop a numerical method for computing higher order local approximations of center manifolds near steady states in Hamiltonian systems. The underlying system is assumed to be large in the sense that a large sparse Jacobian at the equilibrium occurs, for which only a linear solver and a low-dimensional invariant subspace is available. Our method combines this restriction from linear algebra with the requirement that the center manifold is parametrized by a symplectic mapping and that the reduced equation preserves the Hamiltonian form. Our approach can be considered as a special adaptation of a general method from Numer. Math. 80 (1998) 1-38 to the Hamiltonian case such that approximations of the reduced Hamiltonian are obtained simultaneously. As an application we treat a finite difference system for an elliptic problem on an infinite strip.     

<Emphasis FontCategory="NonProportional">L</Emphasis>-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program

The classes ofL ₁-matrices,L ₂-matrices,L ₃-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example. Partially supported by NSFC. This author is also with College of Business Administration of Human University as a Lotus chair professor.     

<Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript> linear interpolator for missing values in time series

We propose a minimum mean absolute error linear interpolator (MMAELI), based on theL ₁ approach. A linear functional of the observed time series due to non-normal innovations is derived. The solution equation for the coefficients of this linear functional is established in terms of the innovation series. It is found that information implied in the innovation series is useful for the interpolation of missing values. The MMAELIs of the AR(1) model with innovations following mixed normal andt distributions are studied in detail. The MMAELI also approximates the minimum mean squared error linear interpolator (MMSELI) well in mean squared error but outperforms the MMSELI in mean absolute error. An application to a real series is presented. Extensions to the general ARMA model and other time series models are discussed. This research was supported by a CityU Research Grant and Natural Science Foundation of China.     

线性规划的符号跟踪算法

分析了只含一个约束条件的线性规划最优基变量的特征，将其运用到搜寻含m个约束条件的线性规划的最优基变量，从而提出了线性规划的符号跟踪算法，为线性规划求解提供了新途径。     

求解非对称线性方程组的QMRGCGS方法

1 引言 求解非对称线性方程组Ax=b的双共轭梯度方法(BCG)[3]和它的变形共轭梯度平方方法(CGS)[6]都有典型的不规则收敛行为,后来Freund和Nachtigal提出一种BCG类方法,即拟极小剩余方法(QMR)[7],用来补救BCG方法的收敛性并且产生了光滑的收敛曲线。然而,象BCG方法一样,QMR方法要用到系数矩阵A及其转置A~T与向量的乘积,为了解决这一问题,Freund提出TFQMR方法,此方法具有拟极小剩余性,同时不需用到A~T与向量的乘积。