A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

Latin Squares without Orthogonal Mates

In 1779 Euler proved that for every even n there exists a latin square of order n that has no orthogonal mate, and in 1944 Mann proved that for every n of the form 4k + 1, k ≥ 1, there exists a latin square of order n that has no orthogonal mate. Except for the two smallest cases, n = 3 and n = 7, it is not known whether a latin square of order n = 4k + 3 with no orthogonal mate exists or not. We complete the determination of all n for which there exists a mate-less latin square of order n by proving that, with the exception of n = 3, for all n = 4k + 3 there exists a latin square of order n with no orthogonal mate. We will also show how the methods used in this paper can be applied more generally by deriving several earlier non-orthogonality results.     

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

Iterative regularization methods for atmospheric remote sensing

In this paper we present different inversion algorithms for nonlinear ill-posed problems arising in atmosphere remote sensing. The proposed methods are Landweber's method (LwM), the iteratively regularized Gauss-Newton method, and the conventional and regularizing Levenberg-Marquardt method. In addition, some accelerated LwMs and a technique for smoothing the Levenberg-Marquardt solution are proposed. The numerical performance of the methods is studied by means of simulations. Results are presented for an inverse problem in atmospheric remote sensing, i.e., temperature sounding with an airborne uplooking high-resolution far-infrared spectrometer.     

四种多变量校准方法在FTIR多组分分析中的性能比较

本文对四种多变量校准方法－－经典最小二乘法（CLS），偏最小二乘法（PLS），卡尔曼滤波法（KFM）以及人工神经网络法（ANN）－－在多组分浓度分析方面的性能进行了比较。选择五种红外谱图严重混叠的大气有机毒物－－1，3－丁二烯，苯，邻二甲苯，氯苯和丙烯醛－－作为分析对象。分别计算各种方法对该5组分体系的平均预测误差MPE和平均相对误差MRE进行比较。结果表明，偏最小二乘法在处理这类问题中是最稳健的方法。     

A geometric theory forL 2-stability of the inverse problem in a one-dimensional elliptic equation from anH 1-observation

This study provides a stability theory for the nonlinear least-squares formulation of estimating the diffusion coefficient in a two-point boundary-value problem from an error-corrupted observation of the state variable. It is based on analysing the projection of the observation on the nonconvex attainable set.This research was started while G. Chavent visited the Technical University of Graz. Support through the Steiermaerkische Landesregierung is gratefully acknowledged.     

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