A Van der Pol-Mathieu equation for the dynamics of dust grain charge in dusty plasmas

The chaotic profile of dust grain dynamics associated with dust-acoustic oscillations in a dusty plasma is considered. The collective behaviour of the dust plasma component is described via a multi-fluid model, comprising Boltzmann distributed electrons and ions, as well as an equation of continuity possessing a source term for the dust grains, the dust momentum and Poisson's equations. A Van der Pol–Mathieu-type nonlinear ordinary differential equation for the dust grain density dynamics is derived. The dynamical system is cast into an autonomous form by employing an averaging method. Critical stability boundaries for a particular trivial solution of the governing equation with varying parameters are specified. The equation is analysed to determine the resonance region, and finally numerically solved by using a fourth-order Runge–Kutta method. The presence of chaotic limit cycles is pointed out.

Discretization and solution of the inhomogeneous Bogoliubov-de Gennes equations

In the presence of inhomogeneities, defects and currents, the equations describing a Bose-condensed ensemble of alkali atoms have to be solved numerically. By combining both linear and nonlinear equations within a Discrete Variable Representation framework, we describe a computational scheme for the solution of the coupled Bogoliubov-de Gennes (BdG) and nonlinear Schrodinger (NLS) equations for fields in a 3D spheroidal potential. We use the method to calculate the collective excitation spectrum and quasiparticle mode densities for excitations of a Bose condensed gas in a spheroidal trap. The method is compared against finite-difference and spectral methods, and we find the DVR computational scheme to be superior in accuracy and efficiency for the cases we consider. (C) 2004 Elsevier B.V. All rights reserved.

Improving multi-site benefit functions via Bayesian model averaging: A new approach to benefit transfer

A benefit function transfer obtains estimates of willingness-to-pay (WTP) for the evaluation of a given policy at a site by combining existing information from different study sites. This has the advantage that more efficient estimates are obtained, but it relies on the assumption that the heterogeneity between sites is appropriately captured in the benefit transfer model. A more expensive alternative to estimate WTP is to analyze only data from the policy site in question while ignoring information from other sites. We make use of the fact that these two choices can be viewed as a model selection problem and extend the set of models to allow for the hypothesis that the benefit function is only applicable to a subset of sites. We show how Bayesian model averaging (BMA) techniques can be used to optimally combine information from all models. The Bayesian algorithm searches for the set of sites that can form the basis for estimating a benefit function and reveals whether such information can be transferred to new sites for which only a small data set is available. We illustrate the method with a sample of 42 forests from U.K. and Ireland. We find that BMA benefit function transfer produces reliable estimates and can increase about 8 times the information content of a small sample when the forest is 'poolable'. © 2008 Elsevier Inc. All rights reserved.

Covariance Averaging for Improved Estimation and Portfolio Allocation

We propose a new method for estimating the covariance matrix of a multivariate time series of nancial returns. The method is based on estimating sample covariances from overlapping windows of observations which are then appropriately weighted to obtain the nal covariance estimate. We extend the idea of (model) covariance averaging o ered in the covariance shrinkage approach by means of greater ease of use, exibility and robustness in averaging information over different data segments. The suggested approach does not su er from the curse of dimensionality and can be used without problems of either approximation or any demand for numerical optimization.