Classical solutions of the leading-logarithm approximation with non-trivial topology

Exact solutions of the classical equations corresponding to the leading-logarithm approximation are obtained. They are classified by an (integer) topological number.

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.

SAT Modulo Linear Arithmetic for Solving Polynomial

Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints based on encoding the problem into an SMT problem considering only linear arithmetic. Unlike other existing methods, our method focuses on proving satisfiability of the constraints rather than on proving unsatisfiability, which is more relevant in several applications as we illustrate with several examples. Nevertheless, we also present new techniques based on the analysis of unsatisfiable cores that allow one to efficiently prove unsatisfiability too for a broad class of problems. The power of our approach is demonstrated by means of extensive experiments comparing our prototype with state-of-the-art tools on benchmarks taken both from the academic and the industrial world.

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.

Symmetric periodic orbits near heteroclinic loops at infinity for a class of polynomial vector fields

For polynomial vector fields in R3, in general, it is very difficult to detect the existence of an open set of periodic orbits in their phase portraits. Here, we characterize a class of polynomial vector fields of arbitrary even degree having an open set of periodic orbits. The main two tools for proving this result are, first, the existence in the phase portrait of a symmetry with respect to a plane and, second, the existence of two symmetric heteroclinic loops.

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)

Biased diffusion in confined media: Test of the Fick-Jacobs approximation and validity criteria

We study biased, diffusive transport of Brownian particles through narrow, spatially periodic structures in which the motion is constrained in lateral directions. The problem is analyzed under the perspective of the Fick-Jacobs equation, which accounts for the effect of the lateral confinement by introducing an entropic barrier in a one-dimensional diffusion. The validity of this approximation, based on the assumption of an instantaneous equilibration of the particle distribution in the cross section of the structure, is analyzed by comparing the different time scales that characterize the problem. A validity criterion is established in terms of the shape of the structure and of the applied force. It is analytically corroborated and verified by numerical simulations that the critical value of the force up to which this description holds true scales as the square of the periodicity of the structure. The criterion can be visualized by means of a diagram representing the regions where the Fick-Jacobs description becomes inaccurate in terms of the scaled force versus the periodicity of the structure.