Latent scale linear models for multivariate ordinal responses and analysis by the method of weighted least squares

Summary A multivariate latent scale linear model is defined for multivariate ordered categorical responses and inference procedures based on the weighted least squares method are developed. Several applications of the model are suggested and illustrated through an analysis of real data. Asymptotic properties of the weighted least squares method are examined and some consequences of misspecification of the model are also discussed.     

Scattered data fitting of Hermite type by a weighted meshless method

In many practical problems, it is often desirable to interpolate not only the function values but also the values of derivatives up to certain order, as in the Hermite interpolation. The Hermite interpolation method by radial basis functions is used widely for solving scattered Hermite data approximation problems. However, sometimes it makes more sense to approximate the solution by a least squares fit. This is particularly true when the data are contaminated with noise. In this paper, a weighted meshless method is presented to solve least squares problems with noise. The weighted meshless method by Gaussian radial basis functions is proposed to fit scattered Hermite data with noise in certain local regions of the problem’s domain. Existence and uniqueness of the solution is proved. This approach has one parameter which can adjust the accuracy according to the size of the noise. Another advantage of the weighted meshless method is that it can be used for problems in high dimensions with nonregular domains. The numerical experiments show that our weighted meshless method has better performance than the traditional least squares method in the case of noisy Hermite data.     

Exponential curve fitting with least squares

A comparison is made between standard least squares and a weighted least squares technique for exponential data.     

����ȱʧ���ݵ�B������ָ��ģ�͹���

??In this paper, we studied the inverse probability weighted least squares estimation of single-index model with response variable missing at random. Firstly, the B-spline technique is used to approximate the unknown single-index function, and then the objective function is established based on the inverse probability weighted least squares method. By the two-stage Newton iterative algorithm, the estimation of index parameters and the B-spline coefficients can be obtained. Finally, through many simulation examples and a real data application, it can be concluded that the method proposed in this paper performs very well for moderate sample     

A dynamic meshless method for the least squares problem with some noisy subdomains

The interpolation method by radial basis functions is used widely for solving scattered data approximation. However, sometimes it makes more sense to approximate the solution by least squares fit. This is especially true when the data are contaminated with noise. A meshfree method namely, meshless dynamic weighted least squares (MDWLS) method, is presented in this paper to solve least squares problems with noise. The MDWLS method by Gaussian radial basis function is proposed to fit scattered data with some noisy areas in the problem’s domain. Existence and uniqueness of a solution is proved. This method has one parameter which can adjusts the accuracy according to the size of noises. Another advantage of the developed method is that it can be applied to problems with nonregular geometrical domains. The new approach is applied for some problems in two dimensions and the obtained results confirm the accuracy and efficiency of the proposed method. The numerical experiments illustrate that our MDWLS method has better performance than the traditional least squares method in case of noisy data.     

Strong underrelaxation in Kaczmarz's method for inconsistent systems

Summary We investigate the behavior of Kaczmarz's method with relaxation for inconsistent systems. We show that when the relaxation parameter goes to zero, the limits of the cyclic subsequences generated by the method approach a weighted least squares solution of the system. This point minimizes the sum of the squares of the Euclidean distances to the hyperplanes of the system. If the starting point is chosen properly, then the limits approach the minimum norm weighted least squares solution. The proof is given for a block-Kaczmarz method.     

Tikhonov regularization for weighted total least squares problems

In this work, we study and analyze the regularized weighted total least squares (RWTLS) formulation. Our regularization of the weighted total least squares problem is based on the Tikhonov regularization. Numerical examples are presented to demonstrate the effectiveness of the RWTLS method.     

数据拟合函数的加权最小二乘积分法

数据拟合的方法很多,每种方法各有特点.探讨了积分准则下的数据加权拟合函数的方法,称为加权最小二乘积分法,并给出了三个常用拟合函数具体形式.     

An algorithm for linear least squares problems with equality and nonnegativity constraints

We present a new algorithm for solving a linear least squares problem with linear constraints. These are equality constraint equations and nonnegativity constraints on selected variables. This problem, while appearing to be quite special, is the core problem arising in the solution of the general linearly constrained linear least squares problem. The reduction process of the general problem to the core problem can be done in many ways. We discuss three such techniques.The method employed for solving the core problem is based on combining the equality constraints with differentially weighted least squares equations to form an augmented least squares system. This weighted least squares system, which is equivalent to a penalty function method, is solved with nonnegativity constraints on selected variables.Three types of examples are presented that illustrate applications of the algorithm. The first is rank deficient, constrained least squares curve fitting. The second is concerned with solving linear systems of algebraic equations with Hilbert matrices and bounds on the variables. The third illustrates a constrained curve fitting problem with inconsistent inequality constraints.     

Local Weighted Composite Quantile Estimating for Varying Coefficient Models

A generalization of classical linear models is varying coefficient models, which offer a flexible approach to modeling nonlinearity between covariates. A method of local weighted composite quantile regression is suggested to estimate the coefficient functions. The local Bahadur representation of the local estimator is derived and the asymptotic normality of the resulting estimator is established. Comparing to the local least squares estimator, the asymptotic relative efficiency is examined for the local weighted composite quantile estimator. Both theoretical analysis and numerical simulations reveal that the local weighted composite quantile estimator can obtain more efficient than the local least squares estimator for various non-normal errors. In the normal error case, the local weighted composite quantile estimator is almost as efficient as the local least squares estimator. Monte Carlo results are consistent with our theoretical findings. An empirical application demonstrates the potential of the proposed method.     

Stability analysis of the G-algorithm and a note on its application to sparse least squares problems

The G-algorithm was proposed by Bareiss [1] as a method for solving the weighted linear least squares problem. It is a square root free algorithm similar to the fast Givens method except that it triangularizes a rectangular matrix a column at a time instead of one element at a time.In this paper an error analysis of the G-algorithm is presented which shows that it is as stable as any of the standard orthogonal decomposition methods for solving least squares problems. The algorithm is shown to be a competitive method for sparse least squares problems.A pivoting strategy is given for heavily weighted problems similar to that in [14] for the Householder-Golub algorithm. The strategy is prohibitively expensive, but it is not necessary for most of the least squares problems that arise in practice.The research was supported by the National Science Foundation under contract no. MCS-8201065 and by the Office of Naval Research under contract no. N0014-80-0517.     

Iterative weighted partial spline least squares estimation in semiparametric modeling of longitudinal data

In this paper we consider the estimating problem of a semiparametric regression modelling whenthe data are longitudinal.An iterative weighted partial spline least squares estimator(IWPSLSE)for the para-metric component is proposed which is more efficient than the weighted partial spline least squares estimator(WPSLSE)with weights constructed by using the within-group partial spline least squares residuals in the sense     

Application of gradient descent method to the sedimentary grain-size distribution fitting

Existence of a least squares solution for a sum of several weighted normal functions is proved. The gradient descent (GD) method is used to fit the measured data (i.e. the laser grain-size distribution of the sediments) with a sum of three weighted lognormal functions. The numerical results indicate that the GD method is not only easy to operate but also could effectively optimize the parameters of the fitting function with the error decreasing steadily. Meanwhile the overall fitting results are satisfactory. As a new way of data fitting, the GD method could also be used to solve other optimization problems.     

基于最优估计的数据融合理论

本文提出了一种最优加权的数据融合方法，分析了最优权值的分配原则；给出了多源信息统一的线性融合模型，使其表示不受数据类型和融合系统结构的限制，并指出在噪声协方差阵正定的前提下，线性最小方差估计融合和加权最小二乘估计融合是等价的；介绍了数据融合中的Bayes极大后验估计融合方法，给出了利用极大后验法进行传感器数据融合的一般表示公式；最后以两传感器数据融合为例，证明了利用Bayes极大后验估计进行两传感器数据融合所得到的融合状态的精度比相同条件下极大似然估计得到的精度要高，同时它们均优于任一单传感器局部估计精度。     

基于Pena距离的加权最小二乘估计的影响分析

利用Pena距离对加权线性最小二乘估计的影响问题进行讨论,得到加权最小二乘估计的Pena距离的表达式,对其性质进行讨论,从而得到高杠异常点的判别方法.文中对Pena距离与Cook距离的性能进行了对比,得到在一定条件下Pena距离优于Cook距离的结论.并通过数值实验对此方法的有效性进行验证.     

Spectral collocation and radial basis function methods for one-dimensional interface problems

Differential equations with singular sources or discontinuous coefficients yield non-smooth or even discontinuous solutions. This problem is known as the interface problem. High-order numerical solutions suffer from the Gibbs phenomenon in that the accuracy deteriorates if the discontinuity is not properly treated. In this work, we use the spectral and radial basis function methods and present a least squares collocation method to solve the interface problem for one-dimensional elliptic equations. The domain is decomposed into multiple sub-domains; in each sub-domain, the collocation solution is sought. The solution should satisfy more conditions than the given conditions associated with the differential equations, which makes the problem over-determined. To solve the over-determined system, the least squares method is adopted. For the spectral method, the weighted norm method with different scaling factors and the mixed formulation are used. For the radial basis function method, the weighted shape parameter method is presented. Numerical results show that the least squares collocation method provides an accurate solution with high efficacy and that better accuracy is obtained with the spectral method.     

缺失数据下部分非线性变系数EV模型的统计推断

该文研究了响应变量缺失下半参数部分非线性变系数EV模型的统计推断问题,利用逆概率加权局部纠偏profile最小二乘法构造了模型中非参数分量和参数分量的估计,证明了估计量的渐近正态性.通过数值模拟和实际数据分析,验证了所提出的估计方法是有效的.     

Error estimation for a weighted minimum-norm least squares solution with positive definite weights

The weighted least squares problem is considered. Given a generally inconsistent system of linear algebraic equations, error estimates are obtained for its weighted minimum-norm least squares solution under perturbations of the matrix and the right-hand side, including the case of rank modifications of the perturbed matrix.     

A note on the least squares solution of the groundwater flow equation

The least squares finite element method is a member of the weighted residuals class of numerical methods for solving partial differential equations. The least squares finite element method is applied to the groundwater flow equation. Space is discretized with a C¹ continuous trial function and parameters are approximated with a C⁰ bilinear basis. Solutions for problems containing parameters with large localized spatial gradients are characterized by errors that are propagated throughout the entire domain. Second-order spatial convergence is observed, and extreme mesh refinement is required to match Galerkin and mixed least squares finite element results. Temporal discretization should be kept separate from the least squares spatial discretization. © 1994 John Wiley & Sons, Inc.     

Detection of outliers in weighted least squares regression

In multiple linear regression model, we have presupposed assumptions (independence, normality, variance homogeneity and so on) on error term. When case weights are given because of variance heterogeneity, we can estimate efficiently regression parameter using weighted least squares estimator. Unfortunately, this estimator is sensitive to outliers like ordinary least squares estimator. Thus, in this paper, we proposed some statistics for detection of outliers in weighted least squares regression.