失效树分析的矩阵化方法

研究了布尔代数运算的矩阵化表示方法，并在此基础上，基于上行法提出了一种求解失效树顶事件失效概率及元件重要度的矩阵化方法，使得系统可靠性分析的失效树方法能够简便、容易地在计算机上自动进行。算例表明，本文方法正确、可靠。

杂交应力元的应力子空间和柔度矩阵H对角化方法

证明了:1)杂交元假设应力模式线性无关是柔度矩阵非奇异的充分必要条件;以及2)等价假设应力模式形成相同的杂交元· 在此基础上建立了假设应力模式的希尔伯特应力子空间,从而可以利用斯密特方法简单地得到等价的正交归一化应力模式,实现了柔度矩阵对角化,使得杂交元形成过程中完全避免了繁杂的矩阵求逆运算,极大地提高了杂交元分析的计算效率。

结构力学静定拱内力的矩阵化求解方法

类似于结构力学课程中矩阵位移法的解题思路,通过对静定三铰拱某截面的内力分析,采用线性代数矩阵的表达形式,推导出静定拱截面内力计算的内力矩阵方程,定义了坐标矩阵、内力列向量和综合外荷载列向量,提出了静定拱结构内力的矩阵化求解方法,并给出了具体的计算方法和步骤,便于实现参数化分析和计算机编程求解,简化静定拱内力计算的过程,通过实例验证该方法在手算求解时的便捷性,并希望引入到结构力学的教学中。

求解各向异性分层介质中水平电偶极辐射的实用方法

用矩阵对角化方法求解了在各向异性分层介质中水平电偶极的辐射问题 ,并引入“过渡矢量”,利用其传播特性求得定解 ,此方法简单实用 ,不要求相似变换矩阵归一化。作为应用 。

线性系统对偶Luenberger观测器设计

提出了线性系统对偶Luenberger观测器的参数化设计方法.基于一类广义Sylvester矩阵方程的显式参数化解,根据一些自由参数给出了对偶Luenberger观测器所有增益矩阵的参数化表达.该设计方法能提供所有的设计自由度,它们能进一步用来实现系统的其他性能指标.数值例子显示了该方法的设计过程.

Linear and Nonlinear Optical Absorptions of a Hydrogenic Donor in a Quantum Dot Under a Magnetic Field

The linear and nonlinear optical properties of a hydrogenic donor in a disc-like parabolic quantum dot in the presence of an external magnetic field are studied. The calculations were performed within the effective mass approximation, using the matrix diagonalization method and the compact density-matrix approach. The linear and nonlinear optical absorption coefficients between the ground （L =0） and the first excited state （L = 1） have been examined based on the computed energies and wave functions. We find that the linear, nonlinear third-order, and total optical absorption coefficients are strongly affected by the confinement strength of QDs, the external magnetic field, and the incident optical intensity.

Control of chemical chaos

Lyapunov exponents can act as the judgment rule whether the systems is chaotic or not.We propose an approach to control chaotic systems by varying the Lyapunov exponents of the system. At last we use this method to control a chemical system. Both the theoretical analysis and the simulation results prove that this method can quickly and effectively stabilize the chaotic systems to the desire points.

Full Graph Methods of Switched Current Circuit Solution

Circuits with switched current are described by an admittance matrix and seeking current transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to carry out an analysis of the whole switched circuit in two-phase switching exclusively by the graph method as well. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphs to reduce Mason graphs for all the four phases of switching, and then plot a summary graph from the transformed graphs obtained this way. First the author draws nodes and possible branches, obtained by transformation graphs for transfers of EE （even-even） and OO （odd-odd） phases. In the next step, branches obtained by transformation graphs for EO and OE phase are drawn between these nodes, while their resulting transfer is 1 multiplied by z^1/2. This summary graph is extended by two branches from input node and to output node, the extended graph can then be interpreted by the Mason＇s relation to provide transparent current transfers. Therefore it is not necessary to compose a sum admittance matrix and to express this consequently in numbers, and so it is possible to reach the final result in a graphical way.

Theoretical research on reservoir closed-loop production management

Closed-loop production management combines the process of history matching and production optimization together to peri-odically updates the reservoir model and determine the optimal control strategy for production development to realize the goal of decreasing the knowledge of model uncertainty as well as maximize the economic benefits for the expected reservoir life. The adjoint-gradient-based methods seem to be the most efficient algorithms for closed-loop management. Due to complicated calculation and limited availability of adjoint-gradient in commercial reservoir simulators, the application of this method is still prohibited for real fields. In this paper, a simultaneous perturbation stochastic approximation (SPSA) algorithm is proposed for reservoir closed-loop production management with the combination of a parameterization way for history matching and a co-variance matrix to smooth well controls for production optimization. By using a set of unconditional realizations, the proposed parameterization method can transform the minimization of the objective function in history matching from a higher dimension to a lower dimension, which is quite useful for large scale history matching problem. Then the SPSA algorithm minimizes the objective function iteratively to get an optimal estimate reservoir model. Based on a prior covariance matrix for production op-timization, the SPSA algorithm generates a smooth stochastic search direction which is always uphill and has a certain time correlation for well controls. The example application shows that the SPSA algorithm for closed-loop production management can decrease the geological uncertainty and provide a reasonable estimate reservoir model without the calculation of the ad-joint-gradient. Meanwhile, the well controls optimized by the alternative SPSA algorithm are fairly smooth and significantly improve the effect of waterflooding with a higher NPV and a better sweep efficiency than the reactive control strategy.

1-Bit compressive sensing: Reformulation and RRSP-based sign recovery theory

Recently, the 1-bit compressive sensing （1-bit CS） has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or the sign of a signal that can be exactly recovered with a decoding method. We first show that a necessary assumption （that has been overlooked in the literature） should be made for some existing theories and discussions for 1-bit CS. Without such an assumption, the found solution by some existing decoding algorithms might be inconsistent with 1-bit measurements. This motivates us to pursue a new direction to develop uniform and nonuniform recovery theories for 1-bit CS with a new decoding method which always generates a solution consistent with 1-bit measurements. We focus on an extreme case of 1-bit CS, in which the measurements capture only the sign of the product of a sensing matrix and a signal. We show that the 1-bit CS model can be reformulated equivalently as an t0-minimization problem with linear constraints. This reformulation naturally leads to a new linear-program-based decoding method, referred to as the 1-bit basis pursuit, which is remarkably different from existing formulations. It turns out that the uniqueness condition for the solution of the 1-bit basis pursuit yields the so-called restricted range space property （RRSP） of the transposed sensing matrix. This concept provides a basis to develop sign recovery conditions for sparse signals through 1-bit measurements. We prove that if the sign of a sparse signal can be exactly recovered from 1-bit measurements with 1-bit basis pursuit, then the sensing matrix must admit a certain RRSP, and that if the sensing matrix admits a slightly enhanced RRSP, then the sign of a k-sparse signal can be exactly recovered with 1-bit basis pursuit.

Polaron Effect of a Two Electron Parabolic Quantum Dot

Polaron induced double electron in a quantum dot is investigated using the exact diagonalization techniques and the compact density-matrix approach. The dependence of nonlinear optical processes on the incident photon energies and the polaronic effect are brought out. The linear, third order non-linear optical absorption coefficients and the refractive index changes of singlet and triplet states as a function of photon energy are obtained with and without the inclusion of polaronic effect. It is found that the geometrical confinement and the effect of polaron have great influence on the optical properties of dots.