Global asymptotic stability in a class of Putnam-type equations

In this paper, we initiate the study of a class of Putnam-type equation of the form x(n-1) = A(1)x(n) + A(2)x(n-1) + A(3)x(n-2)x(n-3) + A(4)/B(1)x(n)x(n-1) + B(2)x(n-2) + B(3)x(n-3) + B-4 n = 0, 1, 2,..., where A(1), A(2), A(3), A(4), B-1, B-2, B-3, B-4 are positive constants with A(1) + A(2) + A(3) + A(4) = B-1 + B-2 + B-3 + B-4, x(-3), x(-2), x(-1), x(0) are positive numbers. A sufficient condition is given for the global asymptotic stability of the equilibrium point c = 1 of such equations. (c) 2005 Elsevier Ltd. All rights reserved.

Global asymptotic stability in a rational recursive sequence

In this paper, we study the global stability of the difference equation x(n) = a + bx(n-1) + cx(n-1)(2)/d - x(n-2), n = 1,2,....., where a, b greater than or equal to 0 and c, d > 0. We show that one nonnegative equilibrium point of the equation is a global attractor with a basin that is determined by the parameters, and every positive Solution of the equation in the basin exponentially converges to the attractor. (C) 2003 Elsevier Inc. All rights reserved.

The price of risk in construction projects: contingency approximation model (CAM)

Little attention has been focussed on a precise definition and evaluation mechanism for project management risk specifically related to contractors. When bidding, contractors traditionally price risks using unsystematic approaches. The high business failure rate our industry records may indicate that the current unsystematic mechanisms contractors use for building up contingencies may be inadequate. The reluctance of some contractors to include a price for risk in their tenders when bidding for work competitively may also not be a useful approach. Here, instead, we first define the meaning of contractor contingency, and then we develop a facile quantitative technique that contractors can use to estimate a price for project risk. This model will help contractors analyse their exposure to project risks; and help them express the risk in monetary terms for management action. When bidding for work, they can decide how to allocate contingencies strategically in a way that balances risk and reward.

Strong-segregation limit of the self-consistent field theory for diblock copolymer melts

The self-consistent field theory (SCFT) introduced by Helfand for diblock copolymer melts is expected to converge to the strong-segregation theory (SST) of Semenov in the asymptotic limit, $\chi N \rightarrow \infty$. However, past extrapolations of the lamellar/cylinder and cylinder/sphere phase boundaries, within the standard unit-cell approximation, have cast some doubts on whether or not this is actually true. Here we push the comparison further by extending the SCFT calculations to $\chi N = 512,000$, by accounting for exclusion zones in the coronae of the cylindrical and spherical unit cells, and by examining finite-segregation corrections to SST. In doing so, we provide the first compelling evidence that SCFT does indeed reduce to SST.

Robust blind deconvolution algorithm: variance approximation and series decoupling

An alternative blind deconvolution algorithm for white-noise driven minimum phase systems is presented and verified by computer simulation. This algorithm uses a cost function based on a novel idea: variance approximation and series decoupling (VASD), and suggests that not all autocorrelation function values are necessary to implement blind deconvolution.

Modelling and control of Hammerstein system using B-spline approximation and the inverse of De Boor algorithm

In this article a simple and effective controller design is introduced for the Hammerstein systems that are identified based on observational input/output data. The nonlinear static function in the Hammerstein system is modelled using a B-spline neural network. The controller is composed by computing the inverse of the B-spline approximated nonlinear static function, and a linear pole assignment controller. The contribution of this article is the inverse of De Boor algorithm that computes the inverse efficiently. Mathematical analysis is provided to prove the convergence of the proposed algorithm. Numerical examples are utilised to demonstrate the efficacy of the proposed approach.

A Wiener model for memory high power amplifiers using B-spline function approximation

In this paper we introduce a new Wiener system modeling approach for memory high power amplifiers in communication systems using observational input/output data. By assuming that the nonlinearity in the Wiener model is mainly dependent on the input signal amplitude, the complex valued nonlinear static function is represented by two real valued B-spline curves, one for the amplitude distortion and another for the phase shift, respectively. The Gauss-Newton algorithm is applied for the parameter estimation, which incorporates the De Boor algorithm, including both the B-spline curve and the first order derivatives recursion. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.

Unit-cell approximation for diblock−copolymer brushes grafted to spherical particles

This paper examines the equilibrium phase behavior of thin diblock-copolymer films tethered to a spherical core, using numerical self-consistent field theory (SCFT). The computational cost of the calculation is greatly reduced by implementing the unit-cell approximation (UCA) routinely used in the study of bulk systems. This provides a tremendous reduction in computational time, permitting us to map out the phase behavior more extensively and allowing us to consider far larger particles. The main consequence of the UCA is that it omits packing frustration, but evidently the effect is minor for large particles. On the other hand, when the particles are small, the UCA calculation can be readily followed up with the full SCFT, the comparison to which conveniently allows one to quantitatively assess the effect of packing frustration.

Approximation of non-autonomous dynamic systems by continuous time recurrent neural networks

This work provides a framework for the approximation of a dynamic system of the form x˙=f(x)+g(x)u by dynamic recurrent neural network. This extends previous work in which approximate realisation of autonomous dynamic systems was proven. Given certain conditions, the first p output neural units of a dynamic n-dimensional neural model approximate at a desired proximity a p-dimensional dynamic system with n>p. The neural architecture studied is then successfully implemented in a nonlinear multivariable system identification case study.

Learning in neural networks and stochastic approximation methods with averaging

The problem of adjusting the weights (learning) in multilayer feedforward neural networks (NN) is known to be of a high importance when utilizing NN techniques in various practical applications. The learning procedure is to be performed as fast as possible and in a simple computational fashion, the two requirements which are usually not satisfied practically by the methods developed so far. Moreover, the presence of random inaccuracies are usually not taken into account. In view of these three issues, an alternative stochastic approximation approach discussed in the paper, seems to be very promising.

Asymptotic expansions for Taylor coefficients of the composition of two functions

We give an asymptotic expansion for the Taylor coe±cients of L(P(z)) where L(z) is analytic in the open unit disc whose Taylor coe±cients vary `smoothly' and P(z) is a probability generating function. We show how this result applies to a variety of problems, amongst them obtaining the asymptotics of Bernoulli transforms and weighted renewal sequences.

Plane wave discontinuous Galerkin methods for the 2D Helmholtz equation: analysis of the $p$-version

Plane wave discontinuous Galerkin (PWDG) methods are a class of Trefftz-type methods for the spatial discretization of boundary value problems for the Helmholtz operator $-\Delta-\omega^2$, $\omega>0$. They include the so-called ultra weak variational formulation from [O. Cessenat and B. Després, SIAM J. Numer. Anal., 35 (1998), pp. 255–299]. This paper is concerned with the a priori convergence analysis of PWDG in the case of $p$-refinement, that is, the study of the asymptotic behavior of relevant error norms as the number of plane wave directions in the local trial spaces is increased. For convex domains in two space dimensions, we derive convergence rates, employing mesh skeleton-based norms, duality techniques from [P. Monk and D. Wang, Comput. Methods Appl. Mech. Engrg., 175 (1999), pp. 121–136], and plane wave approximation theory.

Plane wave approximation of homogeneous Helmholtz solutions

In this paper, we study the approximation of solutions of the homogeneous Helmholtz equation Δu + ω 2 u = 0 by linear combinations of plane waves with different directions. We combine approximation estimates for homogeneous Helmholtz solutions by generalized harmonic polynomials, obtained from Vekua’s theory, with estimates for the approximation of generalized harmonic polynomials by plane waves. The latter is the focus of this paper. We establish best approximation error estimates in Sobolev norms, which are explicit in terms of the degree of the generalized polynomial to be approximated, the domain size, and the number of plane waves used in the approximations.