por que contenga las palabras

Busqueda avanzada

3 documentos corresponden a la consulta.
Palabras contadas: costs: 8, computational: 54
Alcoba, D.R. - Torre, A. - Lain, L. - Bochicchio, R.C.
J Chem Phys 2005;122(7)
2005

Descripción: This work describes simple decompositions of the energy of molecular systems according to schemes that partition the three-dimensional space. The components of those decompositions depend on one and two atomic domains thus providing a meaningful chemical information about the nature of different bondings among the atoms which compose the system. Our algorithms can be applied at any level of theory (correlated or uncorrelated wave functions). The results reported here, obtained at the Hartree-Fock level in selected molecules, show a good agreement with the chemical picture of molecules and require a low computational cost in comparison with other previously reported decompositions.
...ver más

Tipo de documento: info:ar-repo/semantics/artículo

Méndez-Díaz, I. - Zabala, P. - Lucena, A.
Discrete Appl Math 2008;156(17):3223-3237
2008

Descripción: The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamiltonian path equals the sum of the costs for the layers of paths (along the Hamiltonian path) going from the depot vertex to each of the remaining vertices. In this paper, we propose a new Integer Programming formulation for the problem and computationally evaluate the strength of its Linear Programming relaxation. Computational results are also presented for a cutting plane algorithm that uses a number of valid inequalities associated with the proposed formulation. Some of these inequalities are shown to be facet defining for the convex hull of feasible solutions to that formulation. These inequalities proved very effective when used to reinforce Linear Programming relaxation bounds, at the nodes of a Branch and Bound enumeration tree. © 2008 Elsevier B.V. All rights reserved.
...ver más

Tipo de documento: info:ar-repo/semantics/artículo

Sánchez, V.M. - Sued, M. - Scherlis, D.A.
J Chem Phys 2009;131(17)
2009

Descripción: Continuum solvent models have become a standard technique in the context of electronic structure calculations, yet no implementations have been reported capable to perform molecular dynamics at solid-liquid interfaces. We propose here such a continuum approach in a density functional theory framework using plane-wave basis sets and periodic boundary conditions. Our work stems from a recent model designed for Car-Parrinello simulations of quantum solutes in a dielectric medium [D. A. Scherlis, J. Chem. Phys. 124, 074103 (2006)], for which the permittivity of the solvent is defined as a function of the electronic density of the solute. This strategy turns out to be inadequate for systems extended in two dimensions: the dependence of the dielectric function on the electronic density introduces a new term in the Kohn-Sham potential, which becomes unphysically large at the interfacial region, seriously affecting the convergence of the self-consistent calculations. If the dielectric medium is properly redefined as a function of the atomic coordinates, a good convergence is obtained and the constant of motion is conserved during the molecular dynamics simulations. The Poisson problem is solved using a multigrid method, and in this way Car-Parrinello molecular dynamics simulations of solid-liquid interfaces can be performed at a very moderate computational cost. This scheme is employed to investigate the acid-base equilibrium at the TiO2 -water interface. The aqueous behavior of titania surfaces has stimulated a large amount of experimental research, but many open questions remain concerning the molecular mechanisms determining the chemistry of the interface. Here we make an attempt to answer some of them, putting to the test our continuum model. © 2009 American Institute of Physics.
...ver más

Tipo de documento: info:ar-repo/semantics/artículo