INVERSE EIGENVALUE PROBLEM OF HERMITIAN GENERALIZED ANTI-HAMILTONIAN MATRICES

§1　IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti…     

Researches of DC—Problem Under the Model S in which the Numbers of Defective Coins are not Fixed

In this paper,we research general Defective Cion Problem under the model S,i.e,the number d of Defective cions is not fixed. For d=O,1,or 2. we get some good results.     

在有限执行假设下对最优契约的扩展模型研究

本文运用违约保证金条款改进了代理人事前报酬契约；在契约有限执行的假设下，扩展了代理人的逆向选择模型，并运用扩展逆向选择模型分析了改进后的最优报酬契约。文章指出，改进后的最优报酬契约严格优于委托人为防范代理人违约而被迫采用的非负参与性约束条件下的最优报酬契约。     

带有不等式约束的全局最优性条件

本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件.     

Scaling by Binormalization

We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.     

矩阵方程（A^TXA，B^TXB=（C，D）的反对称解及其最佳逼近

本利用矩阵对的标准相关分解，得到了矩阵方程(A^TXB，B^TXB)=(C，D)反对称解存在的充分必要条件及通解表达式，同时给出了解关于已知矩阵的最佳逼近．     

随机需求条件下的延迟发运策略模型及性质

本针对随机需求条件下物流配送中心的库存和运输联合决策问题，在基本库存和自身运输能力不足的情况下，提出对剩余客户订货需求采取部分延迟到下一期与部分利用第三方物流立即发运两相结合的策略，并在具有一般惩罚(损失)费延迟发运量限制的条件下，建立运输和库存相关总成本数学期望最小的优化模型，论证了该模型的主要性质，在此基础上很容易构造求解该类问题的优化方法。     

Motion Control by ZV Shaper Synthesis Extended for Fractional Systems and Its Application to CRONE Control

Shaping command input or preshaping is used for reducing system oscillation in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual oscillation. This technique, developed by N.C. Singer and W.P. Seering, is used for example in the aerospace field, in particular in flexible structure control. This paper presents the study of ZV shaper for explicit fractional derivative systems (generalized derivative systems). A robustness study of ZV shaper is then presented and applied to improve second generation CRONE control response time. Results from simulation and from a DC motor bench are also given.     

Functional Quantization and Small Ball Probabilities for Gaussian Processes

Quantization consists in studying the L ^r -error induced by the approximation of a random vector X by a vector (quantized version) taking a finite number n of values. We investigate this problem for Gaussian random vectors in an infinite dimensional Banach space and in particular, for Gaussian processes. A precise link proved by Fehringer⁽⁴⁾ and Dereich et al. ⁽³⁾ relates lower and upper bounds for small ball probabilities with upper and lower bounds for the quantization error, respectively. We establish a complete relationship by showing that the same holds for the direction from the quantization error to small ball probabilities. This allows us to compute the exact rate of convergence to zero of the minimal L ^r -quantization error from logarithmic small ball asymptotics and vice versa.     

Optimal control of the obstacle in a quasilinear elliptic variational inequality

In this paper we consider an obstacle control problem where the state satisfies a quasilinear elliptic variational inequality and the control function is the obstacle. The state is chosen to be close to the desire profile while the H² norms of the obstacle is not too large. Existence and necessary conditions for the optimal control are established.