Convergence of discrete and penalized least squares spherical splines

We study the convergence of discrete and penalized least squares spherical splines in spaces with stable local bases. We derive a bound for error in the approximation of a sufficiently smooth function by the discrete and penalized least squares splines. The error bound for the discrete least squares splines is explicitly dependent on the mesh size of the underlying triangulation. The error bound for the penalized least squares splines additionally depends on the penalty parameter.     

Some observations on local least squares

In previous work we introduced a construction to produce biorthogonal multiresolutions from given subdivisions. The approach involved estimating the solution to a least squares problem by means of a number of smaller least squares approximations on local portions of the data. In this work we use a result by Dahlquist, et al. on the method of averages to make observational comparisons between this local least squares estimation and full least squares approximation. We have explored examples in two problem domains: data reduction and data approximation. We observe that, particularly for design matrices with a repetitive pattern of column entries, the least squares solution is often well estimated by local least squares, that the estimation rapidly improves with the size of the local least squares problems, and that the quality of the estimate is largely independent of the size of the full problem. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 93E24     

A new technique of quaternion equality constrained least squares problem

By means of complex representation of a quaternion matrix, we study the relationship between the solutions of the quaternion equality constrained least squares problem and that of complex equality constrained least squares problem, and obtain a new technique of finding a solution of the quaternion equality constrained least squares problem.     

Algebraic techniques for least squares problem over generalized quaternion algebras: A unified approach in quaternionic and split quaternionic theory

This paper aims to present, in a unified manner, algebraic techniques for least squares problem in quaternionic and split quaternionic mechanics. This paper, by means of a complex representation and a real representation of a generalized quaternion matrix, studies generalized quaternion least squares (GQLS) problem, and derives two algebraic methods for solving the GQLS problem. This paper gives not only algebraic techniques for least squares problem over generalized quaternion algebras, but also a unification of algebraic techniques for least squares problem in quaternionic and split quaternionic theory.     

半参数回归模型的稳健补偿最小二乘估计

本文研究了一类半参数回归模型，利用稳健补偿最小二乘估计法，得到了稳健补偿最小二乘估计量，以及它们的影响函数及渐近方差一协方差，对结果的分析表明了该法优于补偿最小二乘法，而且具有稳定性．     

Maximum likelihood least squares identification for systems with autoregressive moving average noise

Maximum likelihood methods are important for system modeling and parameter estimation. This paper derives a recursive maximum likelihood least squares identification algorithm for systems with autoregressive moving average noises, based on the maximum likelihood principle. In this derivation, we prove that the maximum of the likelihood function is equivalent to minimizing the least squares cost function. The proposed algorithm is different from the corresponding generalized extended least squares algorithm. The simulation test shows that the proposed algorithm has a higher estimation accuracy than the recursive generalized extended least squares algorithm.     

A weighted least squares method for scattered data fitting

In this paper, we present a weighted least squares method to fit scattered data with noise. Existence and uniqueness of a solution are proved and an error bound is derived. The numerical experiments illustrate that our weighted least squares method has better performance than the traditional least squares method in case of noisy data.     

On the perturbation of least squares problems with equality constraints

Some new perturbation results are presented for least squares problems with equality constraints, in which relative errors are obtained on perturbed solutions, least squares residuals, and vectors of Lagrange multipliers of the problem, based on the equivalence of the problem to a usual least squares problem and optimal perturbation results for orthogonal projections.     

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.     

Generalized least squares estimation of the functional multivariate linear errors-in-variables model

Estimators of the parameters of the functional multivariate linear errors-in-variables model are obtained by the application of generalized least squares to the sample matrix of mean squares and products. The generalized least squares estimators are shown to be consistent and asymptotically multivariate normal. Relationships between generalized least squares estimation of the functional model and of the structural model are demonstrated. It is shown that estimators constructed under the assumption of normal x are appropriate for fixed x.     

剔除相关性的最小二乘研究

本文提出了一种新的回归模型,剔除相关性的最小二乘,它有效的克服了变量间的相关性,兼顾到变量的筛选。并与最小二乘、向后删除变量法、偏最小二乘比较分析。发现剔除相关性的最小二乘能很好的处理自变量间多重相关性,对变量进行有效的筛选,克服了回归系数反常的现象。     

Randomized algorithms for total least squares problems

Motivated by the recently popular probabilistic methods for low‐rank approximations and randomized algorithms for the least squares problems, we develop randomized algorithms for the total least squares problem with a single right‐hand side. We present the Nyström method for the medium‐sized problems. For the large‐scale and ill‐conditioned cases, we introduce the randomized truncated total least squares with the known or estimated rank as the regularization parameter. We analyze the accuracy of the algorithm randomized truncated total least squares and perform numerical experiments to demonstrate the efficiency of our randomized algorithms. The randomized algorithms can greatly reduce the computational time and still maintain good accuracy with very high probability.     

PLS regression: A directional signal-to-noise ratio approach

We present a new approach to univariate partial least squares regression (PLSR) based on directional signal-to-noise ratios (SNRs). We show how PLSR, unlike principal components regression, takes into account the actual value and not only the variance of the ordinary least squares (OLS) estimator. We find an orthogonal sequence of directions associated with decreasing SNR. Then, we state partial least squares estimators as least squares estimators constrained to be null on the last directions. We also give another procedure that shows how PLSR rebuilds the OLS estimator iteratively by seeking at each step the direction with the largest difference of signals over the noise. The latter approach does not involve any arbitrary scale or orthogonality constraints.     

On perturbations of some constrained subspaces

Perturbation bounds of subspaces, such as eigen-spaces, singular subspaces, and canonical subspaces, have been extensively studied in the literature. In this paper, we study perturbations of some constrained subspaces of 1×2, 2×1, and 2×2 block matrices, in which only one of the sub-matrices can be changed. Such problems rise from the least squares–total least squares problem, the constrained least squares problem, and the constrained total least squares problem.     

广义最小二乘估计为BLUE的若干条件

本文给出了一般广义最小二乘估计为BLUE的一个充要条件及几个充分条件。     

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.     

An algorithm for solving the indefinite least squares problem with equality constraints

An algorithm for computing the solution of indefinite least squares problems and of indefinite least squares problems with equality constrained is presented. Such problems arise when solving total least squares problems and in H ^∞-smoothing. The proposed algorithm relies only on stable orthogonal transformations reducing recursively the associated augmented matrix to proper block anti-triangular form. Some numerical results are reported showing the properties of the algorithm.     

A modified least squares FE-method for ideal fluid flow problems

A modified least squares FE-method suitable e.g. for calculating the ideal fluid flow is presented. It turns out to be essentially more efficient than the conventional least squares method.     

Krylov subspace methods with deflation and balancing preconditioners for least squares problems

For solving least squares problems, the CGLS method is a typical method in the point of view of iterative methods. When the least squares problems are ill-conditioned, the convergence behavior of the CGLS method will present a deteriorated result. We expect to select other iterative Krylov subspace methods to overcome the disadvantage of CGLS. Here the GMRES method is a suitable algorithm for the reason that it is derived from the minimal residual norm approach, which coincides with least squares problems. Ken Hayami proposed BAGMRES for solving least squares problems in [\emph{GMRES Methods for Least Squares Problems, SIAM J. Matrix Anal. Appl., 31(2010)}, pp.2400-2430]. The deflation and balancing preconditioners can optimize the convergence rate through modulating spectral distribution. Hence, in this paper we utilize preconditioned iterative Krylov subspace methods with deflation and balancing preconditioners in order to solve ill-conditioned least squares problems. Numerical experiments show that the methods proposed in this paper are better than the CGLS method.     

Monotonic properties of the least squares mean

We settle an open problem of several years standing by showing that the least squares mean for positive definite matrices is monotone for the usual (Loewner) order. Indeed we show this is a special case of its appropriate generalization to partially ordered complete metric spaces of nonpositive curvature. Our techniques extend to establish other basic properties of the least squares mean such as continuity and joint concavity. Moreover, we introduce a weighted least squares mean and derive our results in this more general setting.