Algorithms and statistical analysis for linear structured weighted total least squares problem

Weighted total least squares(WTLS)have been regarded as the standard tool for the errors-in-variables(EIV)model in which all the elements in the observation vector and the coefficient matrix are contaminated with random errors.However,in many geodetic applications,some elements are error-free and some random observations appear repeatedly in different positions in the augmented coefficient matrix.It is called the linear structured EIV(LSEIV)model.Two kinds of methods are proposed for the LSEIV model from functional and stochastic modifications.On the one hand,the functional part of the LSEIV model is modified into the errors-in-observations(EIO)model.On the other hand,the stochastic model is modified by applying the Moore-Penrose inverse of the cofactor matrix.The algorithms are derived through the Lagrange multipliers method and linear approximation.The estimation principles and iterative formula of the parameters are proven to be consistent.The first-order approximate variance-covariance matrix(VCM)of the parameters is also derived.A numerical example is given to compare the performances of our proposed three algorithms with the STLS approach.Afterwards,the least squares(LS),total least squares(TLS)and linear structured weighted total least squares(LSWTLS)solutions are compared and the accuracy evaluation formula is proven to be feasible and effective.Finally,the LSWTLS is applied to the field of deformation analysis,which yields a better result than the traditional LS and TLS estimations.

Numerical Simulation of Oil-Water Two-Phase Flow in Low Permeability Tight Reservoirs Based on Weighted Least Squares Meshless Method

In response to the complex characteristics of actual low-permeability tight reservoirs,this study develops a meshless-based numerical simulation method for oil-water two-phase flow in these reservoirs,considering complex boundary shapes.Utilizing radial basis function point interpolation,the method approximates shape functions for unknown functions within the nodal influence domain.The shape functions constructed by the aforementioned meshless interpolation method haveδ-function properties,which facilitate the handling of essential aspects like the controlled bottom-hole flow pressure in horizontal wells.Moreover,the meshless method offers greater flexibility and freedom compared to grid cell discretization,making it simpler to discretize complex geometries.A variational principle for the flow control equation group is introduced using a weighted least squares meshless method,and the pressure distribution is solved implicitly.Example results demonstrate that the computational outcomes of the meshless point cloud model,which has a relatively small degree of freedom,are in close agreement with those of the Discrete Fracture Model(DFM)employing refined grid partitioning,with pressure calculation accuracy exceeding 98.2%.Compared to high-resolution grid-based computational methods,the meshless method can achieve a better balance between computational efficiency and accuracy.Additionally,the impact of fracture half-length on the productivity of horizontal wells is discussed.The results indicate that increasing the fracture half-length is an effective strategy for enhancing production from the perspective of cumulative oil production.

Comparative Study of Probabilistic and Least-Squares Methods for Developing Predictive Models

This article explores the comparison between the probability method and the least squares method in the design of linear predictive models. It points out that these two approaches have distinct theoretical foundations and can lead to varied or similar results in terms of precision and performance under certain assumptions. The article underlines the importance of comparing these two approaches to choose the one best suited to the context, available data and modeling objectives.

Least Squares One-Class Support Tensor Machine

One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification problem for second-order tensor data. Traditional vector-based one-class classification methods such as one-class support vector machine (OCSVM) and least squares one-class support vector machine (LSOCSVM) have limitations when tensor is used as input data, so we propose a new tensor one-class classification method, LSOCSTM, which directly uses tensor as input data. On one hand, using tensor as input data not only enables to classify tensor data, but also for vector data, classifying it after high dimensionalizing it into tensor still improves the classification accuracy and overcomes the over-fitting problem. On the other hand, different from one-class support tensor machine (OCSTM), we use squared loss instead of the original loss function so that we solve a series of linear equations instead of quadratic programming problems. Therefore, we use the distance to the hyperplane as a metric for classification, and the proposed method is more accurate and faster compared to existing methods. The experimental results show the high efficiency of the proposed method compared with several state-of-the-art methods.

PSR-SQUARES:基于程序空间约简器的SQL逆向合成系统

针对SQUARES程序空间增长过快,导致程序合成效率偏低的问题,在SQUARES的基础上,增加了以深度神经网络为核心的程序空间约简器,将给定的<被查询表,查询结果>示例表示成二维张量,作为深度神经网络的输入,网络的输出是关于目标SQL语句合成规则的相关性标记向量。约简器根据神经网络的输出结果,采用末N位淘汰策略,删除与目标SQL语句相关性弱的合成规则,以减少候选SQL语句的生成和验证,提升系统合成效率。对约简器中深度神经网络的结构设计、训练样本集的生成方法和网络训练过程进行了详细描述。同时将PSR-SQUARES与当前有代表性SQL逆向合成系统进行实验对比,实验结果表明,PSR-SQUARES的综合性能不同程度地优于其他合成系统,平均合成时间由SQUARES的251 s降低至130 s,目标程序合成成功率由80%提升至89%。

Robust least squares projection twin SVM and its sparse solution

Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsity.Therefore,it is difficult for LSPTSVM to process large-scale datasets with outliers.In this paper,we propose a robust LSPTSVM model(called R-LSPTSVM)by applying truncated least squares loss function.The robustness of R-LSPTSVM is proved from a weighted perspective.Furthermore,we obtain the sparse solution of R-LSPTSVM by using the pivoting Cholesky factorization method in primal space.Finally,the sparse R-LSPTSVM algorithm(SR-LSPTSVM)is proposed.Experimental results show that SR-LSPTSVM is insensitive to outliers and can deal with large-scale datasets fastly.

The Least Squares {P,Q,k+1}-Reflexive Solution to a Matrix Equation

Let P∈C^(m×m)and Q∈C^(n×n)be Hermitian and{k+1}-potent matrices,i.e.,P k+1=P=P∗,Qk+1=Q=Q∗,where(·)∗stands for the conjugate transpose of a matrix.A matrix X∈C m×n is called{P,Q,k+1}-reflexive(anti-reflexive)if P XQ=X(P XQ=−X).In this paper,the least squares solution of the matrix equation AXB=C subject to{P,Q,k+1}-reflexive and anti-reflexive constraints are studied by converting into two simpler cases:k=1 and k=2.

Revisiting Akaike’s Final Prediction Error and the Generalized Cross Validation Criteria in Regression from the Same Perspective: From Least Squares to Ridge Regression and Smoothing Splines

In regression, despite being both aimed at estimating the Mean Squared Prediction Error (MSPE), Akaike’s Final Prediction Error (FPE) and the Generalized Cross Validation (GCV) selection criteria are usually derived from two quite different perspectives. Here, settling on the most commonly accepted definition of the MSPE as the expectation of the squared prediction error loss, we provide theoretical expressions for it, valid for any linear model (LM) fitter, be it under random or non random designs. Specializing these MSPE expressions for each of them, we are able to derive closed formulas of the MSPE for some of the most popular LM fitters: Ordinary Least Squares (OLS), with or without a full column rank design matrix;Ordinary and Generalized Ridge regression, the latter embedding smoothing splines fitting. For each of these LM fitters, we then deduce a computable estimate of the MSPE which turns out to coincide with Akaike’s FPE. Using a slight variation, we similarly get a class of MSPE estimates coinciding with the classical GCV formula for those same LM fitters.

Two-Stage Procrustes Rotation with Sparse Target Matrix and Least Squares Criterion with Regularization and Generalized Weighting

In factor analysis, a factor loading matrix is often rotated to a simple target matrix for its simplicity. For the purpose, Procrustes rotation minimizes the discrepancy between the target and rotated loadings using two types of approximation: 1) approximate the zeros in the target by the non-zeros in the loadings, and 2) approximate the non-zeros in the target by the non-zeros in the loadings. The central issue of Procrustes rotation considered in the article is that it equally treats the two types of approximation, while the former is more important for simplifying the loading matrix. Furthermore, a well-known issue of Simplimax is the computational inefficiency in estimating the sparse target matrix, which yields a considerable number of local minima. The research proposes a new rotation procedure that consists of the following two stages. The first stage estimates sparse target matrix with lesser computational cost by regularization technique. In the second stage, a loading matrix is rotated to the target, emphasizing on the approximation of non-zeros to zeros in the target by least squares criterion with generalized weighing that is newly proposed by the study. The simulation study and real data examples revealed that the proposed method surely simplifies loading matrices.

ONLINE PARSIMONIOUS LEAST SQUARES SUPPORT VECTOR REGRESSION AND ITS APPLICATION

A simple and effective mechanism is proposed to realize the parsimoniousness of the online least squares support vector regression （LS-SVR）, and the approach is called the OPLS-SVR for short. Hence, the response time is curtailed. Besides, an OPLS-SVR based analytical redundancy technique is presented to cope with the sensor failure and drift problems to guarantee that the provided signals for the aeroengine controller are correct and acceptable. Experiments on the sensor failure and drift show the effectiveness and the validity of the proposed analytical redundancy.

NOVEL WEIGHTED LEAST SQUARES SUPPORT VECTOR REGRESSION FOR THRUST ESTIMATION ON PERFORMANCE DETERIORATION OF AERO-ENGINE

A thrust estimator with high precision and excellent real-time performance is needed to mitigate perfor- mance deterioration for future aero-engines. A weight least squares support vector regression is proposed using a novel weighting strategy. Then a thrust estimator based on the proposed regression is designed for the perfor- mance deterioration. Compared with the existing weighting strategy, the novel one not only satisfies the require- ment of precision but also enhances the real-time performance. Finally, numerical experiments demonstrate the effectiveness and feasibility of the proposed weighted least squares support vector regression for thrust estimator. Key words ： intelligent engine control; least squares ; support vector machine ; performance deterioration

An Effective Multiple Model Least Squares Method in Tracking of a Maneuvering Target

A polynomial model, time origin shifting model(TOSM, is used to describe the trajectory of a moving target .Based on TOSM, a recursive laeast squares(RLS) algorithm with varied forgetting factor is derived for tracking of a non-maneuvering target. In order to apply this algorithm to maneuvering targets tracking ,a tracking signal is performed on-line to determine what kind of TOSm will be in effect to track a target with different dynamics. An effective multiple model least squares filtering and forecasting method dadpted to real tracking of a maneuvering target is formulated. The algorithm is computationally more effcient than Kalman filter and the percentage improvement from simulations show both of them are considerably alike to some extent.

BOOSTING SPARSE LEAST SQUARES SUPPORT VECTOR REGRESSION (BSLSSVR) AND ITS APPLICATION TO THRUST ESTIMATION

In order to realize direct thrust control instead of conventional sensors-based control for aero-engine, a thrust estimator with high accuracy is designed by using the boosting technique to improve the performance of least squares support vector regression （LSSVR）. There exist two distinct features compared with the conven- tional boosting technique： （1） Sampling without replacement is used to avoid numerical instability for modeling LSSVR. （2） To realize the sparseness of LSSVR and reduce the computational complexity, only a subset of the training samples is used to construct LSSVR. Thus, this boosting method for LSSVR is called the boosting sparse LSSVR （BSLSSVR）. Finally, simulation results show that BSLSSVR-based thrust estimator can satisfy the requirement of direct thrust control, i.e. , maximum absolute value of relative error of thrust estimation is not more than 5‰.

Semi-supervised least squares support vector machine algorithm:application to offshore oil reservoir

At the early stages of deep-water oil exploration and development, fewer and further apart wells are drilled than in onshore oilfields. Supervised least squares support vector machine algorithms are used to predict the reservoir parameters but the prediction accuracy is low. We combined the least squares support vector machine （LSSVM） algorithm with semi-supervised learning and established a semi-supervised regression model, which we call the semi-supervised least squares support vector machine （SLSSVM） model. The iterative matrix inversion is also introduced to improve the training ability and training time of the model. We use the UCI data to test the generalization of a semi-supervised and a supervised LSSVM models. The test results suggest that the generalization performance of the LSSVM model greatly improves and with decreasing training samples the generalization performance is better. Moreover, for small-sample models, the SLSSVM method has higher precision than the semi-supervised K-nearest neighbor （SKNN） method. The new semi- supervised LSSVM algorithm was used to predict the distribution of porosity and sandstone in the Jingzhou study area.

On-Line Batch Process Monitoring Using Multiway Kernel Partial Least Squares

An approach for batch processes monitoring and fault detection based on multiway kernel partial least squares(MKPLS) was presented.It is known that conventional batch process monitoring methods,such as multiway partial least squares(MPLS),are not suitable due to their intrinsic linearity when the variations are nonlinear.To address this issue,kernel partial least squares(KPLS) was used to capture the nonlinear relationship between the latent structures and predictive variables.In addition,KPLS requires only linear algebra and does not involve any nonlinear optimization.In this paper,the application of KPLS was extended to on-line monitoring of batch processes.The proposed batch monitoring method was applied to a simulation benchmark of fed-batch penicillin fermentation process.And the results demonstrate the superior monitoring performance of MKPLS in comparison to MPLS monitoring.

Properties of the total least squares estimation

Through theoretical derivation, some properties of the total least squares estimation are found. The total least squares estimation is the linear transformation of the least squares estimation, and the total least squares estimation is unbiased. The condition number of the total least squares estimation is greater than the least squares estimation, so the total least squares estimation is easier to be affected by the data error than the least squares estimation. Then through the further derivation, the relationships of solutions, residuals and unit weight variance estimations between the total least squares and the least squares are given.

Flatness intelligent control via improved least squares support vector regression algorithm

To overcome the disadvantage that the standard least squares support vector regression(LS-SVR) algorithm is not suitable to multiple-input multiple-output(MIMO) system modelling directly,an improved LS-SVR algorithm which was defined as multi-output least squares support vector regression(MLSSVR) was put forward by adding samples' absolute errors in objective function and applied to flatness intelligent control.To solve the poor-precision problem of the control scheme based on effective matrix in flatness control,the predictive control was introduced into the control system and the effective matrix-predictive flatness control method was proposed by combining the merits of the two methods.Simulation experiment was conducted on 900HC reversible cold roll.The performance of effective matrix method and the effective matrix-predictive control method were compared,and the results demonstrate the validity of the effective matrix-predictive control method.

A stabilized least-squares imaging condition with structure constraints

Conventional shot-gather migration uses a cross-correlation imaging condition proposed by Clarebout （1971）, which cannot preserve imaging amplitudes. The deconvolution imaging condition can improve the imaging amplitude and compensate for illumination. However, the deconvolution imaging condition introduces instability issues. The least-squares imaging condition first computes the sum of the cross-correlation of the forward and backward wavefields over all frequencies and sources, and then divides the result by the total energy of the forward wavefield. Therefore, the least-squares imaging condition is more stable than the classic imaging condition. However, the least-squares imaging condition cannot provide accurate results in areas where the illumination is very poor and unbalanced. To stabilize the least-squares imaging condition and balance the imaging amplitude, we propose a novel imaging condition with structure constraints that is based on the least-squares imaging condition. Our novel imaging condition uses a plane wave construction that constrains the imaging result to be smooth along geological structure boundaries in the inversion frame. The proposed imaging condition improves the stability of the imaging condition and balances the imaging amplitude. The proposed condition is applied to two examples, the horizontal layered model and the Sigsbee 2A model. These tests show that, in comparison to the damped least-squares imaging condition, the stabilized least-squares imaging condition with structure constraints improves illumination stability and balance, makes events more consecutive, adjusts the amplitude of the depth layers where the illumination is poor and unbalanced, suppresses imaging artifacts, and is conducive to amplitude preserving imaging of deep layers.

Constrained least squares algorithm for channel vector estimation in 2-D RAKE receiver

Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and then a constrained condition is configured.Traffic signals are further employed to estimate the channel vector based on the constrained leastsquares criterion. We use the iterative least squares with projection (ILSP) algorithm initializedby the pilot to get the estimation. The accuracy of channel estimation and symbol detection can beprogressively increased through the iteration procedure of the ILSP algorithm. Simulation resultsdemonstrate that the proposed algorithm improves the system performance effectively compared withthe conventional 2-D RAKE receiver.

Generalized Penalized Least Squares and Its Statistical Characteristics

The solution properties of semiparametric model are analyzed, especially that penalized least squares for semiparametric model will be invalid when the matrix B^TPB is ill-posed or singular. According to the principle of ridge estimate for linear parametric model, generalized penalized least squares for semiparametric model are put forward, and some formulae and statistical properties of estimates are derived. Finally according to simulation examples some helpful conclusions are drawn.