A redundant subspace weighting procedure for clock ensemble

A redundant-subspace-weighting(RSW)-based approach is proposed to enhance the frequency stability on a time scale of a clock ensemble.In this method,multiple overlapping subspaces are constructed in the clock ensemble,and the weight of each clock in this ensemble is defined by using the spatial covariance matrix.The superimposition average of covariances in different subspaces reduces the correlations between clocks in the same laboratory to some extent.After optimizing the parameters of this weighting procedure,the frequency stabilities of virtual clock ensembles are significantly improved in most cases.

Modeling One Dimensional Two-Cell Model with Tumor Interaction Using Krylov Subspace Methods

A brain tumor occurs when abnormal cells grow, sometimes very rapidly, into an abnormal mass of tissue. The tumor can infect normal tissue, so there is an interaction between healthy and infected cell. The aim of this paper is to propose some efficient and accurate numerical methods for the computational solution of one-dimensional continuous basic models for the growth and control of brain tumors. After computing the analytical solution, we construct approximations of the solution to the problem using a standard second order finite difference method for space discretization and the Crank-Nicolson method for time discretization. Then, we investigate the convergence behavior of Conjugate gradient and generalized minimum residual as Krylov subspace methods to solve the tridiagonal toeplitz matrix system derived.

THE STRESS SUBSPACE OF HYBRID STRESS ELEMENT AND THE DIAGONALIZATION METHOD FOR FLEXIBILITY MATRIX H

The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identical hybrid element. The Hilbert stress subspace of the assumed stress modes is established. So, it is easy to derive the equivalent orthogonal normal stress modes by Schmidt's method. Because of the resulting diagonal flexibility matrix, the identical hybrid element is free from the complex matrix inversion so that the hybrid efficiency, is improved greatly. The numerical examples show that the method is effective.

ROBUSTNESS OF THE SUBSPACE METHOD FOR BLIND SIGNATURE WAVEFORM ESTIMATION WITH RESPECT TO CHANNEL ORDER IN ASYNCHRONOUS DS-CDMA SYSTEMS

The robustness of the subspace method for blind signature waveform estimation with respect to channel order is analyzed in asynchronous DS-CDMA systems theoretically. Theoretical analysis and simulation results show that the overestimating of the channel order will lead to the degradation of the quality of the estimated signature waveform. So we should adopt the channel order as small as possible.

SUBSPACE METHOD FOR BLIND IDENTIFICATION OF CDMA TIME-VARYING CHANNELS

A new blind method is proposed for identification of CDMA Time-Varying (TV)channels in this paper. By representing the TV channel's impulse responses in the delay-Doppler spread domain, the discrete-time canonical model of CDMA-TV systems is developed and a subspace method to identify blindly the Time-Invariant (TI) coordinates is proposed. Unlike existing basis expansion methods, this new algorithm does not require .estimation of the base frequencies, neither need the assumption of linearly varying delays across symbols. The algorithm offers definite explanation of the expansion coordinates. Simulation demonstrates the effectiveness of the algorithm.

Subspace Minimization Conjugate Gradient Method Based on Cubic Regularization Model for Unconstrained Optimization

Many methods have been put forward to solve unconstrained optimization problems,among which conjugate gradient method(CG)is very important.With the increasing emergence of large⁃scale problems,the subspace technology has become particularly important and widely used in the field of optimization.In this study,a new CG method was put forward,which combined subspace technology and a cubic regularization model.Besides,a special scaled norm in a cubic regularization model was analyzed.Under certain conditions,some significant characteristics of the search direction were given and the convergence of the algorithm was built.Numerical comparisons show that for the 145 test functions under the CUTEr library,the proposed method is better than two classical CG methods and two new subspaces conjugate gradient methods.

New Estimates for the Rate of Convergence of the Method of Subspace Corrections

We discuss estimates for the rate of convergence of the method of successive subspace corrections in terms of condition number estimate for the method of parallel subspace corrections.We provide upper bounds and in a special case,a lower bound for preconditioners defined via the method of successive subspace corrections.

Subspace-Based Blind Channel Estimation Method for MIMO-OFDM Systems

A subspace-based blind channel estination algo rithm for MIMO-OFDM systems is proposed. This algorithm exploits the cyclostationarity introduced by cyclic prefix of OFDM to estimate the channel parameters. The proposed new algorithm is found to be outperforming the other algorithm with respect to convergence rate and achievable mean square error and robustness to channel order over determination.

KRYLOV SUBSPACE PROJECTION METHOD AND ITS APPLICATION ON OIL RESERVOIR SIMULATION

Krylov subspace projection methods are known to be highly efficient for solving large linear systems. Many different versions arise from different choices to the left and right subspaces. These methods were classified into two groups in terms of the different forms of matrix H-m, the main properties in applications and the new versions of these two types of methods were briefly reviewed, then one of the most efficient versions, GMRES method was applied to oil reservoir simulation. The block Pseudo-Elimination method was used to generate the preconditioned matrix. Numerical results show much better performance of this preconditioned techniques and the GMRES method than that of preconditioned ORTHMIN method, which is now in use in oil reservoir simulation. Finally, some limitations of Krylov subspace methods and some potential improvements to this type of methods are further presented.

Evaluation of different Krylov subspace methods for simulation of the water faucet problem

In this study,a one-dimensional two-phase flow four-equation model was developed to simulate the water faucet problem.The performance of six different Krylov subspace methods,namely the generalized minimal residual(GMRES),transpose-free quasi-minimal residual,quasi-minimal residual,conjugate gradient squared,biconjugate gradient stabilized,and biconjugate gradient,was evaluated with and without the application of an incomplete LU(ILU)factorization preconditioner for solving the water faucet problem.The simulation results indicate that using the ILU preconditioner with the Krylov subspace methods produces better convergence performance than that without the ILU preconditioner.Only the GMRES demonstrated an acceptable convergence performance under the Krylov subspace methods without the preconditioner.The velocity and pressure distribution in the water faucet problem could be determined using the Krylov subspace methods with an ILU preconditioner,while GMRES could determine it without the need for a preconditioner.However,there are significant advantages of using an ILU preconditioner with the GMRES in terms of efficiency.The different Krylov subspace methods showed similar performance in terms of computational efficiency under the application of the ILU preconditioner.

Reliability-based concurrent subspace optimization method

To avoid the high computational cost and much modification in the process of applying traditional reliability-based design optimization method, a new reliability-based concurrent subspace optimization approach is proposed based on the comparison and analysis of the existing multidisciplinary optimization techniques and reliability assessment methods. It is shown through a canard configuration optimization for a three-surface transport that the proposed method is computationally efficient and practical with the least modification to the current deterministic optimization process.

IMPROVED COVARIANCE DRIVEN BLIND SUBSPACE IDENTIFICATION METHOD

An improved covariance driven subspace identification method is presented to identify the weakly excited modes. In this method, the traditional Hankel matrix is replaced by a reformed one to enhance the identifiability of weak characteristics. The robustness of eigenparameter estimation to noise contamination is reinforced by the improved Hankel matrix, in combination with component energy index （CEI） which indicates the vibration intensity of signal components, an alternative stabilization diagram is adopted to effectively separate spurious and physical modes. Simulation of a vibration system of multiple-degree-of-freedom and experiment of a frame structure subject to wind excitation are presented to demonstrate the improvement of the proposed blind method. The performance of this blind method is assessed in terms of its capability in extracting the weak modes as well as the accuracy of estimated parameters. The results have shown that the proposed blind method gives a better estimation of the weak modes from response signals of small signal to noise ratio （SNR）and gives a reliable separation of spurious and physical estimates.

Third-order nonlinear differential operators preserving invariant subspaces of maximal dimension

In this paper, third-order nonlinear differential operators are studied. It is shown that they are quadratic forms when they preserve invariant subspaces of maximal dimension. A complete description of third-order quadratic operators with constant coefficients is obtained. One example is given to derive special solutions for evolution equations with third-order quadratic operators.

Second-order nonlinear differential operators possessing invariant subspaces of submaximal dimension

The invariant subspace method is used to construct the explicit solution of a nonlinear evolution equation. The second-order nonlinear differential operators that possess invariant subspaces of submaximal dimension are described. There are second-order nonlinear differential operators, including cubic operators and quadratic operators, which preserve an invariant subspace of submaximal dimension. A full. description, of the second-order cubic operators with constant coefficients admitting a four-dimensional invariant subspace is given. It is shown that the maximal dimension of invaxiant subspaces preserved by a second-order cubic operator is four. Several examples are given for the construction of the exact solutions to nonlinear evolution equations with cubic nonlinearities. These solutions blow up in a finite

Random Subspace Learning Approach to High-Dimensional Outliers Detection

We introduce and develop a novel approach to outlier detection based on adaptation of random subspace learning. Our proposed method handles both high-dimension low-sample size and traditional low-dimensional high-sample size datasets. Essentially, we avoid the computational bottleneck of techniques like Minimum Covariance Determinant (MCD) by computing the needed determinants and associated measures in much lower dimensional subspaces. Both theoretical and computational development of our approach reveal that it is computationally more efficient than the regularized methods in high-dimensional low-sample size, and often competes favorably with existing methods as far as the percentage of correct outlier detection are concerned.

A Subspace Iteration for Calculating a Cluster of Exterior Eigenvalues

In this paper we present a new subspace iteration for calculating eigenvalues of symmetric matrices. The method is designed to compute a cluster of k exterior eigenvalues. For example, k eigenvalues with the largest absolute values, the k algebraically largest eigenvalues, or the k algebraically smallest eigenvalues. The new iteration applies a Restarted Krylov method to collect information on the desired cluster. It is shown that the estimated eigenvalues proceed monotonically toward their limits. Another innovation regards the choice of starting points for the Krylov subspaces, which leads to fast rate of convergence. Numerical experiments illustrate the viability of the proposed ideas.

Some Results on the Range-Restricted GMRES Method

In this paper we reconsider the range-restricted GMRES (RRGMRES) method for solving nonsymmetric linear systems. We first review an important result for the usual GMRES method. Then we give an example to show that the range-restricted GMRES method does not admit such a result. Finally, we give a modified result for the range-restricted GMRES method. We point out that the modified version can be used to show that the range-restricted GMRES method is also a regularization method for solving linear ill-posed problems.

拖拉机底盘振动故障诊断与优化——基于模态识别模型

拖拉机是农业生产中非常重要的工具之一,被广泛用于耕种、播种、收割、运输和其他农业活动中。但是,由于农业生产环境恶劣、工况复杂多变,农业拖拉机底盘结构在运行过程中会发生各类故障,进而影响拖拉机工作可靠性,降低农业生产效率。为了精确地识别拖拉机底盘系统早期故障,融合了改进后的平均相关子空间方法,提出了一种以系统响应信号为特征输入的模态识别算法,并采用多次平均后的相关函数信号作为模型输入,通过测定拖拉机底盘不同位置振动信号验证算法的可行性。

An Efficient Method for Reliability-based Multidisciplinary Design Optimization

Design for modem engineering system is becoming multidisciplinary and incorporates practical uncertainties; therefore, it is necessary to synthesize reliability analysis and the multidisciplinary design optimization （MDO） techniques for the design of complex engineering system. An advanced first order second moment method-based concurrent subspace optimization approach is proposed based on the comparison and analysis of the existing multidisciplinary optimization techniques and the reliability analysis methods. It is seen through a canard configuration optimization for a three-surface transport that the proposed method is computationally efficient and practical with the least modification to the current deterministic optimization process.

基于测深侧扫声呐的DOA估计算法研究

针对测深侧扫声呐进行波达方向(Direction of Arrival,DOA)估计时会受到阵元幅度、相位误差及低信噪比影响的问题,提出一种改进的波束域加权子空间拟合算法。首先,采用总体最小二乘-旋转不变子空间算法进行回波方向预估计;其次,将连续线阵划分为多个子阵,并将各个子阵在预估计方向做加权波束形成;再次,采用加权子空间拟合(Weighted Subspace Fitting,WSF)算法构造代价函数;最后,采用阻尼牛顿法求解得到高精度的DOA估计结果。仿真结果表明,文中所提算法在阵元出现幅度相位误差条件下的角度估计均方误差相对于WSF算法减少了约0.03°。海试数据分析结果表明,文中所提算法的测深点均方误差整体优于WSF算法,其相对测深精度提高了约9.8个百分点。以上分析结果表明,文中所提算法整体优于WSF算法,可以实现在阵元幅度相位误差及低信噪比情况下的高精度DOA估计。