Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

偏最小二乘回归的贝叶斯正则化神经网络集成模型在证券分析预测中的应用

神经网络集成技术能有效地提高神经网络的预测精度和泛化能力,已经成为机器学习和神经计算领域的一个研究热点.利用Bagging技术和不同的神经网络算法生成集成个体,并用偏最小二乘回归方法从中提取集成因子,再利用贝叶斯正则化神经网络对其集成,以此建立上证指数预测模型.通过上证指数开、收盘价进行实例分析,计算结果表明该方法预测精度高、稳定性好.     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.     

Superconvergence of discontinuous Galerkin finite element method for the stationary Navier‐Stokes equations

This article focuses on discontinuous Galerkin method for the two‐ or three‐dimensional stationary incompressible Navier‐Stokes equations. The velocity field is approximated by discontinuous locally solenoidal finite element, and the pressure is approximated by the standard conforming finite element. Then, superconvergence of nonconforming finite element approximations is applied by using least‐squares surface fitting for the stationary Navier‐Stokes equations. The method ameliorates the two noticeable disadvantages about the given finite element pair. Finally, the superconvergence result is provided under some regular assumptions. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 421–436, 2007     

CCD光谱谱线标定方法研究

CCD作为光谱分析和测色仪器的光谱接收器件 ,光谱谱线定位受单色仪狭缝和CCD光敏元尺寸影响。提出采用最小二乘法做曲线拟合和质心法来确定光谱线在CCD上的精确定位 ,使光谱谱线的定位精度得到提高 ,并且不受CCD光敏元尺寸限制。实验结果表明 ,两种方法对光谱线的定位 ,具有重复性高 ,稳定性好等特点。在定位精度上 ,两者具有一致性。     

Linear least squares problems with data over incomplete grids

The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points, there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data. We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality constraints. Numerical examples are given to show the effectiveness of the technique presented. AMS subject classification (2000)  65D05, 65D07, 65D10, 65F05, 65F20     

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.     

Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)

In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2).     

Space–time integrated least squares: a time‐marching approach

A time‐marching formulation is derived from the space–time integrated least squares (STILS) method for solving a pure hyperbolic convection equation and is numerically compared to various known methods. Copyright © 2004 John Wiley & Sons, Ltd.     

Robust Adaptive Identification of Fuzzy Systems with Uncertain Data

This study presents a method of adaptive identification of parameters describing Sugeno fuzzy inference system in presence of bounded disturbances while maintaining the readability and interpretability of the fuzzy model during and after identification. This method do not require any a priori knowledge of a bound on the disturbance and noise and of a bound on the unknown parameters values. The method can be used for the robust and adaptive identification of slowly time varying nonlinear systems using fuzzy inference systems. The suggested method was used to build a fuzzy expert system that approximates the functional relationship between physical fitness and some of the measurable physiological parameters by their real measurements and opinion (human-experiences) of a medical expert.