891 resultados para Approximation algorithms
Resumo:
The Brueckner-Hartree-Fock formalism is applied to study spin polarized neutron matter properties. Results of the total energy per particle as a function of the spin polarization and density are presented for two modern realistic nucleon-nucleon interactions, Nijmegen II and Reid93. We find that the dependence of the energy on the spin polarization is practically parabolic in the full range of polarizations. The magnetic susceptibility of the system is computed. Our results show no indication of a ferromagnetic transition which becomes even more difficult as the density increases.
Resumo:
In this paper we propose a generalization of the density functional theory. The theory leads to single-particle equations of motion with a quasilocal mean-field operator, which contains a quasiparticle position-dependent effective mass and a spin-orbit potential. The energy density functional is constructed using the extended Thomas-Fermi approximation and the ground-state properties of doubly magic nuclei are considered within the framework of this approach. Calculations were performed using the finite-range Gogny D1S forces and the results are compared with the exact Hartree-Fock calculations
Resumo:
The real part of the optical potential for heavy ion elastic scattering is obtained by double folding of the nuclear densities with a density-dependent nucleon-nucleon effective interaction which was successful in describing the binding, size, and nucleon separation energies in spherical nuclei. A simple analytical form is found to differ from the resulting potential considerably less than 1% all through the important region. This analytical potential is used so that only few points of the folding need to be computed. With an imaginary part of the Woods-Saxon type, this potential predicts the elastic scattering angular distribution in very good agreement with experimental data, and little renormalization (unity in most cases) is needed.
Resumo:
Exact solutions of the classical equations corresponding to the leading-logarithm approximation are obtained. They are classified by an (integer) topological number.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
For the last 2 decades, supertree reconstruction has been an active field of research and has seen the development of a large number of major algorithms. Because of the growing popularity of the supertree methods, it has become necessary to evaluate the performance of these algorithms to determine which are the best options (especially with regard to the supermatrix approach that is widely used). In this study, seven of the most commonly used supertree methods are investigated by using a large empirical data set (in terms of number of taxa and molecular markers) from the worldwide flowering plant family Sapindaceae. Supertree methods were evaluated using several criteria: similarity of the supertrees with the input trees, similarity between the supertrees and the total evidence tree, level of resolution of the supertree and computational time required by the algorithm. Additional analyses were also conducted on a reduced data set to test if the performance levels were affected by the heuristic searches rather than the algorithms themselves. Based on our results, two main groups of supertree methods were identified: on one hand, the matrix representation with parsimony (MRP), MinFlip, and MinCut methods performed well according to our criteria, whereas the average consensus, split fit, and most similar supertree methods showed a poorer performance or at least did not behave the same way as the total evidence tree. Results for the super distance matrix, that is, the most recent approach tested here, were promising with at least one derived method performing as well as MRP, MinFlip, and MinCut. The output of each method was only slightly improved when applied to the reduced data set, suggesting a correct behavior of the heuristic searches and a relatively low sensitivity of the algorithms to data set sizes and missing data. Results also showed that the MRP analyses could reach a high level of quality even when using a simple heuristic search strategy, with the exception of MRP with Purvis coding scheme and reversible parsimony. The future of supertrees lies in the implementation of a standardized heuristic search for all methods and the increase in computing power to handle large data sets. The latter would prove to be particularly useful for promising approaches such as the maximum quartet fit method that yet requires substantial computing power.
Resumo:
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.
Resumo:
Regulatory gene networks contain generic modules, like those involving feedback loops, which are essential for the regulation of many biological functions (Guido et al. in Nature 439:856-860, 2006). We consider a class of self-regulated genes which are the building blocks of many regulatory gene networks, and study the steady-state distribution of the associated Gillespie algorithm by providing efficient numerical algorithms. We also study a regulatory gene network of interest in gene therapy, using mean-field models with time delays. Convergence of the related time-nonhomogeneous Markov chain is established for a class of linear catalytic networks with feedback loops.