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     

The effect of ITO films thickness on the properties of flexible organic light emitting diode

Indium tin oxide (ITO) thin films were deposited on cyclic olefin copolymer substrate at room temperature by an inverse target sputtering system. The crystal structure and the surface morphology of the deposited ITO films were examined by X-ray diffraction and atomic force microscopy, separately. The electrical properties of the conductive films were explored by four-point probing. Visible spectrometer was used to measure the optical properties of ITO-coated films. The performance of the flexible organic light emitting diode device with different thickness anode was investigated in this study.     

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).     

Lehmer序列中的平方数

设V_n(R,Q)表示参数为R和Q的Lehmer伴随序列,如果R和Q为互素奇数且D=R-4Q>0,我们找出了满足Q_n(R,Q)或nQ_n(R,Q)是平方数的所有奇数n,这里Q_n(R,Q)R~(1/2)=V_n(R,Q)。     

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.     

A statistical study of the analysis of congested spectra by total spectrum fitting

Heavily overlapped, or congested spectra often display much structure but few individual “lines.” Methods have been devised for analyzing such spectra through nonlinear least-squares fitting of the intensity as a function of wavelength or wavenumber. Such total spectrum fitting (TSF) methods are examined statistically for a simple diatomic model and compared with the standard “measure-assign-fit” (MAF) approach in use since the dawn of spectroscopy. Monte Carlo computations on typically 1000 synthetic spectra at a time verify that the predictions of the variance-covariance matrix are reliable under many circumstances. However in regions where the P and R branches double up, the predicted standard errors in the key spectroscopic constants rise sharply and greatly exceed estimates from the Monte Carlo ensemble statistics. In the same regions, the MAF method actually gives better precision. However, for imperfectly overlapped R and P branches, the MAF standard errors are typically three times larger than the TSF values; moreover, the MAF statistical errors are dwarfed by bias. The TSF approach, while clearly superior in these tests, has a practical drawback: it, too, can give significant bias if the spectra are analyzed with an incorrect model, as illustrated here through calculations employing the wrong function to describe the spectral lineshape.     

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.     

Dispersion analysis of the least‐squares finite‐element shallow‐water system

The frequency or dispersion relation for the least‐squares mixed formulation of the shallow‐water equations is analysed. We consider the use of different approximation spaces corresponding to co‐located and staggered meshes, respectively. The study includes the effect of Coriolis, and the dispersion properties are compared analytically and graphically with those of the mixed Galerkin formulation. Numerical solutions of a test problem to simulate slow Rossby modes illustrate the theoretical results. Copyright © 2003 John Wiley & Sons, Ltd.     

A new approach to potential flow around axisymmetric bodies

A new method is introduced to solve potential flow problems around axisymmetric bodies. The approach relies on expressing the infinite series expansion of the Laplace equation solution in terms of a finite sum which preserves the Laplace solution for the potential function under a Neumann-type boundary condition. Then the coefficients of the finite sum are calculated in a least squares approximation sense using the Gram-Schmidt orthonormalization method. Sample benchmark problems are presented and discussed in some detail. The solutions are accurate and converged faster when a rather small number of terms were used. The method is simple and can be easily programmed.