带Hermite插值条件的最小二乘估计

提出了带Hermite插值条件的最小二乘拟合问题,并给出了带Hermite插值条件的最小二乘拟合的拟合曲线的具体表达式.利用Lingo建模语言设计了求解带Hermite插值条件的最小二乘拟合的拟合曲线的Lingo程序,并通过Excel软件得到了求解带Hermite插值条件的最小二乘拟合的拟合曲线的应用软件.     

带插值条件的拟线性最小二乘估计

提出了带插值点的拟线性最小二乘法,并给出了带插值点的拟线性最小二乘法拟合的最小二乘估计,证明了及其参数具有无偏性。     

线性数据拟合方法的误差分析及其改进应用

利用最小二乘法进行线性数据拟合在一定条件下存在着误差较大的缺陷,为使线性数据拟合方法在科学实验和工程实践中能够更加准确地求解量与量之间的关系表达式,本文通过对常用线性数据拟合方法———最小二乘法进行了误差分析,并在此基础上提出了最小距离平方和法以对最小二乘法作改进处理.最后,通过举例分析对两种线性数据拟合方法的优劣加以讨论并分别给出其较为合理的应用控制条件.     

纵向数据半参数回归模型的估计方法

本文考虑纵向数据半参数回归模型,通过考虑纵向数据的协方差结构,基于Profile最小二乘法和局部线性拟合的方法建立了模型中参数分量、回归函数和误差方差的估计量,来提高估计的有效性,在适当条件下给出了这些估计量的相合性.并通过模拟研究将该方法与最小二乘局部线性拟合估计方法进行了比较,表明了Profile最小二乘局部线性拟合方法在有限样本情况下具有良好的性质.     

不等式约束条件下部分线性回归模型的参数估计

本文研究了不等式约束条件下部分线性回归模型的参数估计问题，利用最优化方法和贝叶斯方法，给出了不等式约束条件下部分线性回归模型的最小二乘核估计和最佳贝叶斯估计，并且证明了在一定条件下，带约束条件的最小二乘核估计在均方误差意义下要优于无约束条件的最小二乘核估计。     

基于最小二乘法的空间坐标转换的非迭代算法

利用最小二乘法讨论三维空间的坐标转换问题,先对已知数据进行中心化处理使得坐标转换化为向量形式的最小二乘线性拟合问题,进而化为矩阵形式的最小二乘问题,最后得到法方程以及最小二乘解.如果已知数据量大且维数高,可通过奇异值分解确定相应的转换参数.和现有方法比较,方法的拟合过程不需迭代,简单易行.算例结果表明,拟合结果和原文数据吻合较好.     

半变系数模型改进的轮廓最小二乘估计

针对半变系数模型,在局部线性拟合轮廓最小二乘估计方法的基础上将关于变系数函数的局部线性拟合改进为局部非线性拟合,得到半变系数模型改进的轮廓最小二乘估计,进一步讨论了常值系数的渐进正态性.     

最小二乘法的统计学原理及在农业试验分析中的应用

在现实世界中,普遍地存在着变量之间相互联系、相互制约的关系.那么,怎样用一个简单的解析式较为准确地描述和反映变量之间的关系呢?回归分析是最好的数学工具.在回归分析中,估计回归方程经常用到普通最小二乘法.然而,最小二乘法因其抽象常常被大家所忽视,它是从误差拟合角度对回归模型进行参数估计,并在参数估计以及预测、预报等众多农业领域中得到广泛的应用.就最小二乘法的引入,原理的证明,简单的应用进行归纳和总结.探讨了最小二乘法的线性拟合,对非线性拟合作了简要的叙述,使人们对最小二乘法有更为清晰、系统、全面地认识.农业科学研究影响因素多,能产生多种现象,似乎无规律可循,但是,在一定的条件、范围内,是有一定规律可循的,在这里,采用逆向思维的方法,应用普通最小二乘法就能很好地解决这一类问题,它为农业科研分析提供了一种强有力的手段.     

正交回归和一般最小二乘回归的几何误差分析

线性回归分析中,一般最小二乘回归的目标函数只考虑一个方向的扰动,采用基于几何距离的正交回归能克服固定单方向最优带来的拟合稳定性差的弊端。本文分析和比较了正交回归和一般最小二乘回归的误差,并定量地给出了两者的几何误差与原始数据的方差、相关系数之间的关系,指出正交回归的几何误差小于一般最小二乘回归,并且正交回归具有旋转不变性。最后,以平面直线拟合为例验证了这个结论。     

广义非线性最小二乘问题的一个分离解法

非线性最小二乘涉及数据拟合问题.在测量、实验与科学研究中常用一个选定的含有可调参数向量x∈R~n的函数y=φ(x,t)(通常为x的非线性函数)去拟合一组含有误差的数据(T_j,y_j),j=1,2,…,m,最小二乘就是选择适当的参数向量x使函数x=φ(x,t)在拟合误差平方和最小意义下最优地拟合这些数据.如T_j(j=1,2,…,m)上的误差为零或忽略不计,问题则成为常规非线性最小二乘问题:     

A multi-iterate method to solve systems of nonlinear equations

We propose an extension of secant methods for nonlinear equations using a population of previous iterates. Contrarily to classical secant methods, where exact interpolation is used, we prefer a least squares approach to calibrate the linear model. We propose an explicit control of the numerical stability of the method.     

Continuous piecewise linear finite elements for the Kirchhoff–Love plate equation

A family of continuous piecewise linear finite elements for thin plate problems is presented. We use standard linear interpolation of the deflection field to reconstruct a discontinuous piecewise quadratic deflection field. This allows us to use discontinuous Galerkin methods for the Kirchhoff–Love plate equation. Three example reconstructions of quadratic functions from linear interpolation triangles are presented: a reconstruction using Morley basis functions, a fully quadratic reconstruction, and a more general least squares approach to a fully quadratic reconstruction. The Morley reconstruction is shown to be equivalent to the basic plate triangle (BPT). Given a condition on the reconstruction operator, a priori error estimates are proved in energy norm and L ² norm. Numerical results indicate that the Morley reconstruction/BPT does not converge on unstructured meshes while the fully quadratic reconstruction show optimal convergence.     

Shape-preserving dynamic programming

Dynamic programming is the essential tool in dynamic economic analysis. Problems such as portfolio allocation for individuals and optimal growth of national economies are typical examples. Numerical methods typically approximate the value function and use value function iteration to compute the value function for the optimal policy. Polynomial approximations are natural choices for approximating value functions when we know that the true value function is smooth. However, numerical value function iteration with polynomial approximations is unstable because standard methods such as interpolation and least squares fitting do not preserve shape. We introduce shape-preserving approximation methods that stabilize value function iteration, and are generally faster than previous stable methods such as piecewise linear interpolation.     

Weakly Admissible Meshes and Discrete Extremal Sets

We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, namely Approximate Fekete Points and Discrete Leja Points. These provide new computational tools for polynomial least squares and interpolation on multidimensional compact sets, with different applications such as numerical cubature, digital filtering, spectral and high-order methods for PDEs.     

Local convergence analysis of inexact Gauss-Newton like methods under majorant condition

In this paper, we present a local convergence analysis of inexact Gauss-Newton like methods for solving nonlinear least squares problems. Under the hypothesis that the derivative of the function associated with the least squares problem satisfies a majorant condition, we obtain that the method is well-defined and converges. Our analysis provides a clear relationship between the majorant function and the function associated with the least squares problem. It also allows us to obtain an estimate of convergence ball for inexact Gauss-Newton like methods and some important, special cases.     

Coaxing a planar curve to comply

A long-standing problem in computer graphics is to find a planar curve that is shaped the way you want it to be shaped. A selection of various methods for achieving this goal is presented. The focus is on mathematical conditions that we can use to control curves while still allowing the curves some freedom. We start with methods invented by Newton (1643–1727) and Lagrange (1736–1813) and proceed to recent methods that are the subject of current research. We illustrate almost all the methods discussed with diagrams. Three methods of control that are of special interest are interpolation methods, global minimization methods (such as least squares), and (Bézier) control points. We concentrate on the first of these, interpolation methods.     

On the ill conditioning of locating transmission zeros in least squares ARMA filtering

The algorithms of Levinson-Schur and Nevanlinna-Pick are briefly reviewed. Both produce least squares predictive filters. By minimizing the least squares error with respect to the interpolation points of the Nevanlinna-Pick algorithm we find the transmission zeros of an ARMA filter. It is shown by some simple examples that this is an ill conditioned problem.     

Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems

In this paper, we deal with conjugate gradient methods for solving nonlinear least squares problems. Several Newton-like methods have been studied for solving nonlinear least squares problems, which include the Gauss-Newton method, the Levenberg-Marquardt method and the structured quasi-Newton methods. On the other hand, conjugate gradient methods are appealing for general large-scale nonlinear optimization problems. By combining the structured secant condition and the idea of Dai and Liao (2001) [20], the present paper proposes conjugate gradient methods that make use of the structure of the Hessian of the objective function of nonlinear least squares problems. The proposed methods are shown to be globally convergent under some assumptions. Finally, some numerical results are given.