NEW EFFICIENT ORDER-RECURSIVE LEAST-SQUARES ALGORITHMS

Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order of the underlying model isunknown.On the basis of several universal formulae for updating nonsymmetric projec-tion operators,this paper presents three kinds of LS algorithms,called nonsymmetric,symmetric and square root normalized fast ORLS algorithms,respectively.As to the au-thors’ knowledge,the first and the third have not been so far provided,and the second isone of those which have the lowest computational requirement.Several simplified versionsof the algorithms are also considered.

Piecewise linear recursive convolution FDTD method for magnetized plasmas

The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method greatly improves accuracy over the original recursive convolution （RC） FDTD approach but retains its speed and efficiency advantages. A PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time is presented, enabled the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations the reflection and transmission coefficients through a magnetized plasma layer. The results show that the PLRC-FDTD method has significantly improved the accuracy over the original RC method.

LEAST-SQUARES METHOD-BASED FEATURE FITTING AND EXTRACTION IN REVERSE ENGINEERING

The main purpose of reverse engineering is to convert discrete data pointsinto piecewise smooth, continuous surface models. Before carrying out model reconstruction it issignificant to extract geometric features because the quality of modeling greatly depends on therepresentation of features. Some fitting techniques of natural quadric surfaces with least-squaresmethod are described. And these techniques can be directly used to extract quadric surfaces featuresduring the process of segmentation for point cloud.

ON THE BREAKDOWNS OF THE GALERKIN AND LEAST-SQUARES METHODS

The Galerkin and least-squares methods are two classes of the most popular Krylov subspace methOds for solving large linear systems of equations. Unfortunately, both the methods may suffer from serious breakdowns of the same type: In a breakdown situation the Galerkin method is unable to calculate an approximate solution, while the least-squares method, although does not really break down, is unsucessful in reducing the norm of its residual. In this paper we first establish a unified theorem which gives a relationship between breakdowns in the two methods. We further illustrate theoretically and experimentally that if the coefficient matrix of a lienar system is of high defectiveness with the associated eigenvalues less than 1, then the restarted Galerkin and least-squares methods will be in great risks of complete breakdowns. It appears that our findings may help to understand phenomena observed practically and to derive treatments for breakdowns of this type.

Solution of shallow-water equations using least-squares finite-element method

A least-squares finite-element method （LSFEM） for the non-conservative shallow-water equations is presented. The model is capable of handling complex topography, steady and unsteady flows, subcritical and supercritical flows, and flows with smooth and sharp gradient changes. Advantages of the model include： （1） sources terms, such as the bottom slope, surface stresses and bed frictions, can be treated easily without any special treatment; （2） upwind scheme is no needed; （3） a single approximating space can be used for all variables, and its choice of approximating space is not subject to the Ladyzhenskaya-Babuska-Brezzi （LBB） condition; and （4） the resulting system of equations is symmetric and positive-definite （SPD） which can be solved efficiently with the preconditioned conjugate gradient method. The model is verified with flow over a bump, tide induced flow, and dam-break. Computed results are compared with analytic solutions or other numerical results, and show the model is conservative and accurate. The model is then used to simulate flow past a circular cylinder. Important flow charac-teristics, such as variation of water surface around the cylinder and vortex shedding behind the cylinder are investigated. Computed results compare well with experiment data and other numerical results.

Least-squares finite-element method for shallow-water equations with source terms

Numerical solution of shallow-water equations （SWE） has been a challenging task because of its nonlinear hyperbolic nature, admitting discontinuous solution, and the need to satisfy the C-property. The presence of source terms in momentum equations, such as the bottom slope and friction of bed, compounds the difficulties further. In this paper, a least-squares finite-element method for the space discretization and θ-method for the time integration is developed for the 2D non-conservative SWE including the source terms. Advantages of the method include： the source terms can be approximated easily with interpolation functions, no upwind scheme is needed, as well as the resulting system equations is symmetric and positive-definite, therefore, can be solved efficiently with the conjugate gradient method. The method is applied to steady and unsteady flows, subcritical and transcritical flow over a bump, 1D and 2D circular dam-break, wave past a circular cylinder, as well as wave past a hump. Computed results show good C-property, conservation property and compare well with exact solutions and other numerical results for flows with weak and mild gradient changes, but lead to inaccurate predictions for flows with strong gradient changes and discontinuities.

NEGATIVE NORM LEAST-SQUARES METHODS FOR THE INCOMPRESSIBLE MAGNETOHYDRODYNAMIC EQUATIONS

The purpose of this article is to develop and analyze least-squares approximations for the incompressible magnetohydrodynamic equations. The major advantage of the least-squares finite element method is that it is not subjected to the so-called Ladyzhenskaya-Babuska-Brezzi （LBB） condition. The authors employ least-squares functionals which involve a discrete inner product which is related to the inner product in H^-1（Ω）.

A Revised Piecewise Linear Recursive Convolution FDTD Method for Magnetized Plasmas

The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method improves accuracy over the original recursive convolution （RC） FDTD approach and current density convolution （JEC） but retains their advantages in speed and efficiency. This paper describes a revised piecewise linear recursive convolution PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time, enabling the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations of the reflection and transmission coefficients through a magnetized plasma layer. The results show that the revised PLRC-FDTD method has improved the accuracy over the original RC FDTD method and JEC FDTD method.

Recursive Asymptotic Hybrid Matrix Method for Acoustic Waves in Multilayered Piezoelectric Media

This paper presents the recursive asymptotic hybrid matrix method for acoustic waves in multilayered piezoelectric media. The hybrid matrix method preserves the numerical stability and accuracy across large and small thicknesses. For discussion and comparison, the scattering matrix method is also presented in physics-based form and coherent form. The latter form resembles closely that of hybrid matrix method and helps to highlight their relationship and distinction. For both scattering and hybrid matrix methods, their formulations in terms of eigenwaves solution are provided concisely. Making use of the hybrid matrix, the recursive asymptotic method without eigenwaves solution is described and discussed. The method bypasses the intricacies of eigenvalue-eigenvector approach and requires only elementary matrix operations along with thin- layer asymptotic approximation. It can be used to determine Green’s function matrix readily and facilitates the trade-off between computation efficiency and accuracy.

An Adaptive Least-Squares Mixed Finite Element Method for Fourth Order Parabolic Problems

A least-squares mixed finite element (LSMFE) method for the numerical solution of fourth order parabolic problems analyzed and developed in this paper. The Ciarlet-Raviart mixed finite element space is used to approximate. The a posteriori error estimator which is needed in the adaptive refinement algorithm is proposed. The local evaluation of the least-squares functional serves as a posteriori error estimator. The posteriori errors are effectively estimated. The convergence of the adaptive least-squares mixed finite element method is proved.

LEAST-SQUARES MIXED FINITE ELEMENT METHOD FOR A CLASS OF STOKES EQUATION

A least-squares mixed finite element method was formulated for a class of Stokes equations in two dimensional domains. The steady state and the time-dependent Stokes' equations were considered. For the stationary equation, optimal H-t and L-2-error estimates are derived under the standard regularity assumption on the finite element partition ( the LBB-condition is not required). Far the evolutionary equation, optimal L-2 estimates are derived under the conventional Raviart-Thomas spaces.

Least-Squares Finite Element Method for the Steady Upper-Convected Maxwell Fluid

In this paper, a least-squares finite element method for the upper-convected Maxell (UCM) fluid is proposed. We first linearize the constitutive and momentum equations and then apply a least-squares method to the linearized version of the viscoelastic UCM model. The L2 least-squares functional involves the residuals of each equation multiplied by proper weights. The corresponding homogeneous functional is equivalent to a natural norm. The error estimates of the finite element solution are analyzed when the conforming piecewise polynomial elements are used for the unknowns.

Recursive Fourier Method and Its Application to AC Measurement

The Modified Recursive Fourier Meth(MRFM) is presented here and applied to DISA series integrated substation automation systems for AC measurement comparing with the other measure methods used in RTUs. The application shows its high accuracy, good real time response. And it can measure harmonic in real bine.

Complex derivatives valuation: applying the Least-Squares Monte Carlo Simulation Method with several polynomial basis

Background:This article investigates the Least-Squares Monte Carlo Method by using different polynomial basis in American Asian Options pricing.The standard approach in the option pricing literature is to choose the basis arbitrarily.By comparing four different polynomial basis we show that the choice of basis interferes in the option's price.Methods:We assess Least-Squares Method performance in pricing four different American Asian Options by using four polynomial basis:Power,Laguerre,Legendre and Hermite A.To every American Asian Option priced,three sets of parameters are used in order to evaluate it properly.Results:We show that the choice of the basis interferes in the option's price by showing that one of them converges to the option's value faster than any other by using fewer simulated paths.In the case of an Amerasian call option,for example,we find that the preferable polynomial basis is Hermite A.For an Amerasian put option,the Power polynomial basis is recommended.Such empirical outcome is theoretically unpredictable,since in principle all basis can be indistinctly used when pricing the derivative.Conclusion:In this article The Least-Squares Monte Carlo Method performance is assessed in pricing four different types of American Asian Options by using four different polynomial basis through three different sets of parameters.Our results suggest that one polynomial basis is best suited to perform the method when pricing an American Asian option.Theoretically all basis can be indistinctly used when pricing the derivative.However,our results does not confirm these.We find that when pricing an American Asian put option,Power A is better than the other basis we have studied here whereas when pricing an American Asian call,Hermite A is better.

Recursive Least Square Vehicle Mass Estimation Based on Acceleration Partition

Vehicle mass is an important parameter in vehicle dynamics control systems. Although many algorithms have been developed for the estimation of mass, none of them have yet taken into account the different types of resistance that occur under different conditions. This paper proposes a vehicle mass estimator. The estimator incorporates road gradient information in the longitudinal accelerometer signal, and it removes the road grade from the longitudinal dynamics of the vehicle. Then, two different recursive least square method （RLSM） schemes are proposed to estimate the driving resistance and the mass independently based on the acceleration partition under different conditions. A 6 DOF dynamic model of four In-wheel Motor Vehicle is built to assist in the design of the algorithm and in the setting of the parameters. The acceleration limits are determined to not only reduce the estimated error but also ensure enough data for the resistance estimation and mass estimation in some critical situations. The modification of the algorithm is also discussed to improve the result of the mass estimation. Experiment data on asphalt road, plastic runway, and gravel road and on sloping roads are used to validate the estimation algorithm. The adaptability of the algorithm is improved by using data collected under several critical operating conditions. The experimental results show the error of the estimation process to be within 2.6%, which indicates that the algorithm can estimate mass with great accuracy regardless of the road surface and gradient changes and that it may be valuable in engineering applications. This paper proposes a recursive least square vehicle mass estimation method based on acceleration partition.

Quantitative energy-dispersive X-ray fluorescence analysis for unknown samples using full-spectrum least-squares regression

The full-spectrum least-squares(FSLS) method is introduced to perform quantitative energy-dispersive X-ray fluorescence analysis for unknown solid samples.Based on the conventional least-squares principle, this spectrum evaluation method is able to obtain the background-corrected and interference-free net peaks, which is significant for quantization analyses. A variety of analytical parameters and functions to describe the features of the fluorescence spectra of pure elements are used and established, such as the mass absorption coefficient, the Gi factor, and fundamental fluorescence formulas. The FSLS iterative program was compiled in the C language. The content of each component should reach the convergence criterion at the end of the calculations. After a basic theory analysis and experimental preparation, 13 national standard soil samples were detected using a spectrometer to test the feasibility of using the algorithm. The results show that the calculated contents of Ti, Fe, Ni, Cu, and Zn have the same changing tendency as the corresponding standard content in the 13 reference samples. Accuracies of 0.35% and 14.03% are obtained, respectively, for Fe and Ti, whose standard concentrations are 8.82% and 0.578%, respectively. However, the calculated results of trace elements (only tens of lg/g) deviate from the standard values. This may be because of measurement accuracy and mutual effects between the elements.

Recursive weighted least squares estimation algorithm based on minimum model error principle

Kalman filter is commonly used in data filtering and parameters estimation of nonlinear system,such as projectile's trajectory estimation and control.While there is a drawback that the prior error covariance matrix and filter parameters are difficult to be determined,which may result in filtering divergence.As to the problem that the accuracy of state estimation for nonlinear ballistic model strongly depends on its mathematical model,we improve the weighted least squares method(WLSM)with minimum model error principle.Invariant embedding method is adopted to solve the cost function including the model error.With the knowledge of measurement data and measurement error covariance matrix,we use gradient descent algorithm to determine the weighting matrix of model error.The uncertainty and linearization error of model are recursively estimated by the proposed method,thus achieving an online filtering estimation of the observations.Simulation results indicate that the proposed recursive estimation algorithm is insensitive to initial conditions and of good robustness.

Global interpolating meshless shape function based on generalized moving least-square for structural dynamic analysis

A global interpolating meshless shape function based on the generalized moving least-square （GMLS） is formulated by the transformation technique. Both the shape function and its derivatives meet the Kronecker delta function property. With the interpolating GMLS （IGMLS） shape function, an improved element-free Galerkin （EFG） method is proposed for the structural dynamic analysis. Compared with the conven- tional EFG method, the obvious advantage of the proposed method is that the essential boundary conditions including both displacements and derivatives can be imposed by the straightforward way. Meanwhile, it can greatly improve the ill-condition feature of the standard GMLS approximation, and provide good accuracy at low cost. The dynamic analyses of the Euler beam and Kirchhoff plate are performed to demonstrate the feasi- bility and effectiveness of the improved method. The comparison between the numerical results of the conventional method and the improved method shows that the proposed method has better stability, higher accuracy, and less time consumption.

AN IMPROVED RECURSIVE DOUBLING ALGORITHM FOR THE PARALLEL SOLUTION OF LINEAR RECURRENCE R

An improved recursive doubling algorithm for solving linear recurrence R <n,1>is given,whose parallel time complexity is (τ++τ.) logn when n processors are available,achieving the lower bound in array processor type computation.