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

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

加权广义逆、加权最小二乘和约束最小二乘问题

本文采用如下记号:记C~m×n是具有复数域的m×n长方矩阵的集合,C~m=C~m×1是m维向量的集合.对A∈C~m×n称A~H∈C~m×n是A的共轭转置矩阵,rank(A)表示A的秩,R(A)和N(A)分别为A的值域和零空间,||·||=||·||2和||·||F分别为2-范数和Frobenius范数;I表示恒等矩阵.人们在研究数学规划、数值分析、数据处理,散射理论和电磁学等领域中都将问题归纳为如下的最小二乘问题:     

Logistic回归中的加权最小二乘估计

本文引入因变量是虚拟变量的回归模型 ,并通过logistic函数拟合这种模型 ,分析它在控制和预测方面的不足之处 .在此基础上提出用加权最小二乘估计回归方程 .模拟结果表明 ,此方法是可行的     

散乱数据曲面拟合的局部加权最小二乘插值方法及权函数的选择讨论

本文首先用局部加权最小二乘法将三维空间内任意散乱数据点集均匀,再估计出立方体网格点上的偏导数值及混合偏导数值,最后仅用网格点数据进行快速光滑插值加密计算,从而可得到任意点处的函数值。通过对已知函数的随机数据点集进行计算,取得了令人满意的效果。同时,在最小二乘逼近过程中,本文提供了一种权函数,并与其它二种权函数进行分析比较,给出了各种情况下的误差。     

加权总体最小二乘问题的分析

总体最小二乘问题由Golub和Van Loan首先进行数学的分析,随后人们对于总体最小二乘问题的算法、解的各种形式、总体最小二乘解和最小二乘解的关系、总体最小二乘解的扰动理论以及数值试验作了大量的研究工作。近来,[10]中给出了总体最小二乘问题(TLS)较一般地讨论。另一方面,Golub和Van Loan研究了总体最小二乘问题的特殊均加权形式。本文试图在[10,11]的基础上讨论最一般的总体最小二     

加权总体最小二乘问题的解集和性质

本文讨论了加权总体最小二乘问题的等价解集，分析了加权总体最小二乘解与加权最小二乘问题的解之间的关系。推广了Ｇｏｌｕｂ和Ｖａｎ Ｌｏａｎ，Ｖａｎ Ｈｕｆｆｅｌ和Ｖａｎｄｅｗａｌｌｅ，及Ｗｅｉ的相应结果。     

分布函数的非参数最小二乘估计

By using the non-parametric least square method, the strong consistent estimations of distribution function and failure function are established, where the distribution function F(x)after logist transformation is assumed to be approximated by a polynomial. The performance of simulation shows that the estimations are highly satisfactory.     

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

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

过拟合最小二乘估计的相对效率

讨论线性回归模型中选入过多的解释变量对回归系数估计的影响,给出由过拟合模型求得的最小二乘估计效率的下界。     

求解加权线性最小二乘问题的预处理迭代方法

给出了求解一类加权线性最小二乘问题的预处理迭代方法,也就是预处理的广义加速超松弛方法（GAOR）,得到了一些收敛和比较结果．比较结果表明当原来的迭代方法收敛时,预处理迭代方法会比原来的方法具有更好的收敛率．而且,通过数值算例也验证了新预处理迭代方法的有效性．     

Least Squares Fitting of Circles and Ellipses to Measured Data

Fitting conic sections to data is an important problem with many applications. Often the data are obtained from a physical object using a coordinate measuring machine with a touch probe. The probe directions, relative to a particular frame of reference, are an important part of the problem, although conventional methods make no use of these. Here an approach is used for fitting circles and ellipses which takes account of the measurement design. Algorithms are developed, and some numerical results are given.     

线性流形上矩阵方程B^TXB=D的加权最小二乘对称解和解的最佳逼近

本文利用矩阵的奇异值分解（SVD）,给出了在一流形上矩阵方程B^TXB=D的加权最小二乘对称解的通解表达式,并解决了加权最小二乘对称解的最佳逼近问题。     

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

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

Weighted Least Squares Method for the Accelerated Failure Time Model with Auxiliary Covariates

This paper deals with the analysis of accelerated failure time model when the primary covariate is subject to missing. We assume that the true covariate is     

曲线拟合的广义最小一乘法

介绍了最小一乘法的方程式解法;讨论了这种方程式解法与最小一乘逼近之间的关系;说明了它不仅适用于线性函数类也适用于非线性函数类的最佳逼近的实现;提出了零偏差点附近数据变化的两个重要特征;建立了一种具有"人为"因素的广义最小一乘法;并给出了该法在预测方面的几个应用实例.     

带插指条件的最小二乘法

提出了带插指条件的最小二乘拟合问题,并给出了带插指条件的最小二乘拟合的拟合曲线的具体表达式.     

Least Squares Convex-Concave Data Smoothing

We consider n noisy measurements of a smooth (unknown) function, which suggest that the graph of the function consists of one convex and one concave section. Due to the noise the sequence of the second divided differences of the data exhibits more sign changes than those expected in the second derivative of the underlying function. We address the problem of smoothing the data so as to minimize the sum of squares of residuals subject to the condition that the sequence of successive second divided differences of the smoothed values changes sign at most once. It is a nonlinear problem, since the position of the sign change is also an unknown of the optimization process. We state a characterization theorem, which shows that the smoothed values can be derived by at most 2n – 2 quadratic programming calculations to subranges of data. Then, we develop an algorithm that solves the problem in about O(n ²) computer operations by employing several techniques, including B-splines, the use of active sets, quadratic programming and updating methods. A Fortran program has been written and some of its numerical results are presented. Applications of the smoothing technique may be found in scientific, economic and engineering calculations, when a potential shape for the underlying function is an S-curve. Generally, the smoothing calculation may arise from processes that show initially increasing and then decreasing rates of change.