Generating vortex rings in Bose-Einstein condensates in the line-source approximation

We present a numerical method for generating vortex rings in Bose-Einstein condensates confined in axially symmetric traps. The vortex ring is generated using the line-source approximation for the vorticity, i.e., the curl of the superfluid velocity field is different from zero only on a circumference of a given radius located on a plane perpendicular to the symmetry axis and coaxial with it. The particle density is obtained by solving a modified Gross-Pitaevskii equation that incorporates the effect of the velocity field. We discuss the appearance of density profiles, the vortex core structure, and the vortex nucleation energy, i.e., the energy difference between vortical and ground-state configurations. This is used to present a qualitative description of the vortex dynamics.

Dynamically generated open-charm baryons beyond the zero-range approximation

The interaction of the low-lying pseudoscalar mesons with the ground-state baryons in the charm sector is studied within a coupled-channel approach using a t-channel vector-exchange driving force. The amplitudes describing the scattering of the pseudoscalar mesons off the ground-state baryons are obtained by solving the Lippmann-Schwinger equation. We analyze in detail the effects of going beyond the t=0 approximation. Our model predicts the dynamical generation of several open-charm baryon resonances in different isospin and strangeness channels, some of which can be clearly identified with recently observed states.

When telegrapher's equation furnishes a better approximation to transport equation than the difussion approximation

It has been suggested that a solution to the transport equation which includes anisotropic scattering can be approximated by the solution to a telegrapher's equation [A.J. Ishimaru, Appl. Opt. 28, 2210 (1989)]. We show that in one dimension the telegrapher's equation furnishes an exact solution to the transport equation. In two dimensions, we show that, since the solution can become negative, the telegrapher's equation will not furnish a usable approximation. A comparison between simulated data in three dimensions indicates that the solution to the telegrapher's equation is a good approximation to that of the full transport equation at the times at which the diffusion equation furnishes an equally good approximation.

Approximation and support theorem for a wave equation in two space dimensions

We prove a characterization of the support of the law of the solution for a stochastic wave equation with two-dimensional space variable, driven by a noise white in time and correlated in space. The result is a consequence of an approximation theorem, in the convergence of probability, for equations obtained by smoothing the random noise. For some particular classes of coefficients, approximation in the Lp-norm for p¿1 is also proved.

Eficiencia de las reglas de asignación de agua en el regadío: asignación a través de mercados, de la regla proporcional y de la regla uniforme

En el presente trabajo se simula la introducción de diferentes métodos de reparto del agua en la agricultura, y se aplican a una zona de regadío del valle central del Ebro. En concreto, se han escogido tres métodos diferentes de asignación con el fin de comparar su eficiencia económica. Además del actual sistema proporcional y el sistema de mercado, se simulará la introducción de la regla de reparto uniforme, desarrollada en la teoría de la elección social. Los resultados permiten concluir que aunque el mercado de agua conduzca a mejores resultados globales en todos los casos, la regla uniforme puede resultar una alternativa interesante cuando las dotaciones de agua se encuentran en el intervalo habitual, mientras que en situaciones de escasez severa de agua, el mercado presenta una ventaja más clara con respecto a cualquier otro sistema de asignación. Asimismo, los resultados demuestran que los niveles superiores de heterogeneidad entre los usuarios y altos precios administrativos del agua representan situaciones más ventajosas para la aplicación de la regla de asignación uniforme en comparación con el actual sistema proporcional

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

Fast Approximation of Nonlinearities for improving inversion algorithms of PNL mixtures and Wiener systems

This paper proposes a very fast method for blindly approximating a nonlinear mapping which transforms a sum of random variables. The estimation is surprisingly good even when the basic assumption is not satisfied.We use the method for providing a good initialization for inverting post-nonlinear mixtures and Wiener systems. Experiments show that the algorithm speed is strongly improved and the asymptotic performance is preserved with a very low extra computational cost.

Validity of the acoustic approximation in full-waveform seismic crosshole tomography

Acoustic waveform inversions are an increasingly popular tool for extracting subsurface information from seismic data. They are computationally much more efficient than elastic inversions. Naturally, an inherent disadvantage is that any elastic effects present in the recorded data are ignored in acoustic inversions. We investigate the extent to which elastic effects influence seismic crosshole data. Our numerical modeling studies reveal that in the presence of high contrast interfaces, at which P-to-S conversions occur, elastic effects can dominate the seismic sections, even for experiments involving pressure sources and pressure receivers. Comparisons of waveform inversion results using a purely acoustic algorithm on synthetic data that is either acoustic or elastic, show that subsurface models comprising small low-to-medium contrast (?30%) structures can be successfully resolved in the acoustic approximation. However, in the presence of extended high-contrast anomalous bodies, P-to-S-conversions may substantially degrade the quality of the tomographic images. In particular, extended low-velocity zones are difficult to image. Likewise, relatively small low-velocity features are unresolved, even when advanced a priori information is included. One option for mitigating elastic effects is data windowing, which suppresses later arriving seismic arrivals, such as shear waves. Our tests of this approach found it to be inappropriate because elastic effects are also included in earlier arriving wavetrains. Furthermore, data windowing removes later arriving P-wave phases that may provide critical constraints on the tomograms. Finally, we investigated the extent to which acoustic inversions of elastic data are useful for time-lapse analyses of high contrast engineered structures, for which accurate reconstruction of the subsurface structure is not as critical as imaging differential changes between sequential experiments. Based on a realistic scenario for monitoring a radioactive waste repository, we demonstrated that acoustic inversions of elastic data yield substantial distortions of the tomograms and also unreliable information on trends in the velocity changes.

A Fast Gradient Approximation for Nonlinear Blind Signal Processing

When dealing with nonlinear blind processing algorithms (deconvolution or post-nonlinear source separation), complex mathematical estimations must be done giving as a result very slow algorithms. This is the case, for example, in speech processing, spike signals deconvolution or microarray data analysis. In this paper, we propose a simple method to reduce computational time for the inversion of Wiener systems or the separation of post-nonlinear mixtures, by using a linear approximation in a minimum mutual information algorithm. Simulation results demonstrate that linear spline interpolation is fast and accurate, obtaining very good results (similar to those obtained without approximation) while computational time is dramatically decreased. On the other hand, cubic spline interpolation also obtains similar good results, but due to its intrinsic complexity, the global algorithm is much more slow and hence not useful for our purpose.

On the approximation of the subgrid scale for systems of equations

Postprint (published version)