Invariant Subspace Approach to Linear H∞-Control via Measurement Feedback

This paper analyzes, and thus reveals the structure of the stable invariant subspace of the related Hamiltonian matrix arising from the measurement feedback H -control problem. Using this, it presents another method for the verification of the admissibility of the controller derived by Doyle et al. in 1989. The method not only eliminates unnecessary assumptions on stabilizability and detectability, but also gives deeper insight into the relationship among the stable parts of the associated matrices.     

PICARD ITERATION FOR NONSMOOTH EQUATIONS

1. IntroductionConsider the following nonsmooth equationsF(x) = 0 (l)where F: R" - R" is LipsChitz continuous. A lot of work has been done and is bellg doneto deal with (1). It is basicly a genera1ization of the cIassic Newton method [8,10,11,14],Newton-lthe methods[1,18] and quasiNewton methods [6,7]. As it is discussed in [7], the latter,quasiNewton methods, seem to be lindted when aPplied to nonsmooth caJse in that a boundof the deterioration of uPdating matrir can not be maintained w…     

Numerical analysis of a quadratic matrix equation

The quadratic matrix equation AX²+ BX + C = 0in n x nmatricesarises in applications and is of intrinsic interest as oneof the simplest nonlinear matrix equations. We give a completecharacterization of solutions in terms of the generalized Schurdecomposition and describe and compare various numerical solutiontechniques. In particular, we give a thorough treatment offunctional iteration methods based on Bernoulli’s method.Other methods considered include Newton’s method with exact line searches, symbolic solution and continued fractions.We show that functional iteration applied to the quadraticmatrix equation can provide an efficient way to solve the associated quadratic eigenvalue problem (²A + B + C)x = 0.     

The variational iteration method for solitary patterns solutions of gBBM equation

We consider solitary patterns solutions of generalized Benjamin–Bona–Mahony equations (shortly gBBM). The variational iteration method (shortly VIM) is applied for the numerical solution subject to appropriate initial condition. The numerical solutions of our model equation are calculated in the form of convergence power series with easily computable components. The VIM performs extremely well in terms of accuracy, efficiently, simplicity, stability and reliability.     

直接解调成像的快速算法

直接解调方法(Direct Demodulate Method, DD)中运用的最多的迭代方法是Richardson-Lucy (RL)迭代. RL迭代的公式可以改写成矩阵形式, 其中包含了主要计算量的两次矩阵乘法在点扩展函数满足平移不变性的情况下可以写成卷积的形式, 而卷积可以使用快速傅里叶变换(Fast Fourier Transform, FFT)做快速计算. 详细介绍了上述过程, 并将该方法应用到了硬X射线调制望远镜(Hard X-ray Modulate Telescope,HXMT)的DD成像中, 通过理论的和模拟的计算对比了优化前后DD方法对计算资源的开销.     

Convergence of mann iteration processes for nonexpansive operators in equi-connected metric spaces

The paper deals with various conditions implying the convergence of a Mann type iteration process constructed for a non-expansive operator in an equi-connected space (i. e. metric space equipped with a connecting function; so the iterates are taken along certain curves). Coefficients of the iterates do not have to be separated from 0 or 1. 1].     

矩阵广义对角化的探讨

利用子空间关于矩阵的最小多项式研究了矩阵可广义对角化的充要条件,给出了矩阵可广义对角化的一种算法.     

用方阵乘幂求和法求线性方程组的数值解

介绍了一种新型的,不同于传统的雅克比或高斯塞德尔迭代法的,求解线性方程组的方阵乘幂求和法,并引入了方阵意义上求积分的龙贝格法.该算法成立须以方阵A为实阵,非奇异且主对角元素占优.该法较雅克比或高斯塞德尔迭代的计算量小,特别有助于求解大型线性方程组的问题.     

一类增算子不动点定理及其应用

利用锥理论和非对称迭代方法,讨论了不具有连续性和紧性条件的增算子方程解的存在唯一性.作为其应用着重讨论了非增算子方程解的存在唯一性,并给出了迭代序列收敛于解的误差估计,改进和推广了某些已知结果.