Numerical Methods for a Class of Quadratic Matrix Equations

Quadratic matrix equations arise in many elds of scienti c computing and engineering applications.In this paper,we consider a class of quadratic matrix equations.Under a certain condition,we rst prove the existence of minimal nonnegative solution for this quadratic matrix equation,and then propose some numerical methods for solving it.Convergence analysis and numerical examples are given to verify the theories and the numerical methods of this paper.

一种快速内存纠错方案

本文提出一类能够纠检单个字节错误的最小方阵码,码的校验矩阵的重量达到最小,从而使得编译码电路较省、速度较快。 基于最小方阵码,本文给出一种快速内存纠错方案。

构造最完美幻方的三步法

给出构造双偶数n=4m(m=1,2,…为自然数)阶最完美幻方的三步法及其定理证明.这个方法可得到22m((2m)!)个不同的n阶最完美幻方.

缩影为K_n的图式流形同胚分类算法

讨论了缩影为 Kn 的图式流形的 2种同胚分类算法 ,提出了最小方阵判断法和最小方阵计算法 ,并使用这2种方法 ,计算出了缩影为 3到 9个顶点的完全无向图的同胚类型的个数 。

The Least Square Solutions to the Quaternion Matrix Equation AX=B

A norm of a quaternion matrix is defined. The expressions of the least square solutions of the quaternion matrix equation AX = B and the equation with the constraint condition DX = E are given.

Practical Method for Determining All the Minimum Solutions of Fuzzy Matrix Equation and Transitive Closure of Fuzzy Relation

In this paper,the new theory frame and practical methhod for determining all the minimum solutions of Fuzzy matrix equation and transitive closure of Fuzzy relation is described,and it has been carried out on the miero-computer quickly and accurately.

{P,Q,k+1}-reflexive solutions to a system of matrix equations

In this paper,we investigate the{P,Q,k+1}-reflexive and anti-reflexive solutions to the system of matrix equations AX=C,XB=D and AXB=E.We present the necessary and sufficient conditions for the system men-tioned above to have the{P,Q,k+1}-reflexive and anti-reflexive solutions.We also obtain the expressions of such solutions to the system by the singular value decomposition.Moreover,we consider the least squares{P,Q,k+1}-reflexive and anti-reflexive solutions to the system.Finally,we give an algorithm to illustrate the results of this paper.

ON ANALYSIS METHOD FOR INFRARED MULTI-SITES SYSTEM PERFORMANCE

The calculation method about infrared multi-sites passive system location is introduced based on the principle of the weighted least square method, and the variance matrix of estimated error is offered. Through deduction, it can be found out that treated appraise precision can be directly analyzed and deduced without carrying out real measure and reaching estimation value. The simulation result shows that the system performance based on the weighted least square method is much better than the traditional passive location method, and it can be also used for reference to the research of the location algorithm of similar system.

Comparison of Improved Meshless Interpolation Schemes for SPH Method and Accuracy Analysis

In the smoothed particle hydrodynamics (SPH) method, a meshless interpolation scheme is needed for the unknown function in order to discretize the governing equation.A particle approximation method has so far been used for this purpose.Traditional particle interpolation (TPI) is simple and easy to do, but its low accuracy has become an obstacle to its wider application.This can be seen in the cases of particle disorder arrangements and derivative calculations.There are many different methods to improve accuracy, with the moving least square (MLS) method one of the most important meshless interpolation methods.Unfortunately, it requires complex matrix computing and so is quite time-consuming.The authors developed a simpler scheme, called higher-order particle interpolation (HPI).This scheme can get more accurate derivatives than the MLS method, and its function value and derivatives can be obtained simultaneously.Although this scheme was developed for the SPH method, it has been found useful for other meshless methods.

Asymptotic sum rate of MMSE receivers in multi-user distributed antenna systems

In this paper, the asymptotic sum rate of a multi-user distributed antenna system （DAS） is analyzed. To mitigate inter-user interference, minimum mean squared error （MMSE） receivers are utilized to cooperatively process received signals in the uplink. It shows that inter-user interference is efficiently mitigated and the uplink sum rate of a multi-user DAS is greatly improved by adopting MMSE receivers. For very large number of users and remote antennas, the asymptotic uplink sum rate of MMSE receivers is derived by using virtue of the random matrix theory, which can be The approximation is verified to be quite accurate by Monte Carlo simply calculated in an iterative way simulations.

A Class of Biased Estimators Based on SVD in Linear Model

In this paper, a class of new biased estimators for linear model is proposed by modifying the singular values of the design matrix so as to directly overcome the difficulties caused by ill_conditioning in the design matrix. Some important properties of these new estimators are obtained. By appropriate choices of the biased parameters, we construct many useful and important estimators. An application of these new estimators in three_dimensional position adjustment by distance in a spatial coordiate surveys is given. The results show that the proposed biased estimators can effectively overcome ill_conditioning and their numerical stabilities are preferable to ordinary least square estimation.

A Blind Adaptive Jamming Canceller Using Antenna Array for GPS Receiver

Traditional beamformers need to know the incident angle of the desired signal leading while its abili-ty to handle interference is limited.In this paper,the constrained steer vector of linearly constrained min-imum-variance(LCMV)beamformer is modified to make sidelobe null to direction of powerful jammer.Inaddition,the state-space concept is used to describe the anti-jammer filter,and Kalman filter algorithm isdeduced by building the observation model and measurement equation.The new method is more efficient oncomputation and more robust to survive environment with large scale variation in interference strength.Fi-nally,simulation results shows that the new approach can form the null with its depth in proportion to powerin direction of jammer,and has steady convergence process.The novel method can effectively improve thesignal-to-jammer-plus-noise power ratio(SJNR)of GPS signals to make the correlation peak easy to track.

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.

THE SUPERIORITIES OF BAYES LINEAR UNBIASED ESTIMATION IN PARTITIONED LINEAR MODEL

In this article, the Bayes linear unbiased estimation （BALUE） of parameters is derived for the partitioned linear model. The superiorities of the BALUE over ordinary least square estimator （LSE） are studied in terms of the Bayes mean square error matrix （BMSEM） criterion and Pitman closeness （PC） criterion.

Shrinkage estimation analysis of correlated binary data with a diverging number of parameters

For analyzing correlated binary data with high-dimensional covariates,we,in this paper,propose a two-stage shrinkage approach.First,we construct a weighted least-squares(WLS) type function using a special weighting scheme on the non-conservative vector field of the generalized estimating equations(GEE) model.Second,we define a penalized WLS in the spirit of the adaptive LASSO for simultaneous variable selection and parameter estimation.The proposed procedure enjoys the oracle properties in high-dimensional framework where the number of parameters grows to infinity with the number of clusters.Moreover,we prove the consistency of the sandwich formula of the covariance matrix even when the working correlation matrix is misspecified.For the selection of tuning parameter,we develop a consistent penalized quadratic form(PQF) function criterion.The performance of the proposed method is assessed through a comparison with the existing methods and through an application to a crossover trial in a pain relief study.