Search

In this paper we present a time-domain time-dependent density functional theory (TDDFT) approach to calculate frequency-dependent polarizability and hyperpolarizabilities. In this approach, the electronic degrees of freedom are propagated within the density matrix based TDDFT framework using the efficient modified midpoint and unitary transformation algorithm. We use monochromatic waves as external perturbations and apply the finite field method to extract various orders of the time-dependent dipole moment. By fitting each order of time-dependent dipole to sinusoidal waves with harmonic frequencies, one can obtain the corresponding (hyper)polarizability tensors. This approach avoids explicit Fourier transform and therefore does not require long simulation time. The method is illustrated with application to the optically active organic molecule para-nitroaniline, of which the frequency-dependent polarizability α(-ω; ω), second-harmonic generation β(-2ω; ω, ω), optical rectification β(0; -ω, ω), third-harmonic generation γ(-3ω; ω, ω, ω), and degenerate four-wave mixing γ(-ω; ω, ω, -ω) are calculated. [ABSTRACT FROM AUTHOR]

In this paper, we describe the way to set up the floppy-box Monte Carlo (FBMC) method [L. Filion, M. Marechal, B. van Oorschot, D. Pelt, F. Smallenburg, and M. Dijkstra, Phys. Rev. Lett. 103, 188302 (2009)] to predict crystal-structure candidates for colloidal particles. The algorithm is explained in detail to ensure that it can be straightforwardly implemented on the basis of this text. The handling of hard-particle interactions in the FBMC algorithm is given special attention, as (soft) short-range and semi-long-range interactions can be treated in an analogous way. We also discuss two types of algorithms for checking for overlaps between polyhedra, the method of separating axes and a triangular-tessellation based technique. These can be combined with the FBMC method to enable crystal-structure prediction for systems composed of highly shape-anisotropic particles. Moreover, we present the results for the dense crystal structures predicted using the FBMC method for 159 (non)convex faceted particles, on which the findings in [J. de Graaf, R. van Roij, and M. Dijkstra, Phys. Rev. Lett. 107, 155501 (2011)] were based. Finally, we comment on the process of crystal-structure prediction itself and the choices that can be made in these simulations. [ABSTRACT FROM AUTHOR]

The spatial direct method with gradient-based diffusion is an accelerated stochastic reaction-diffusion simulation algorithm that treats diffusive transfers between neighboring subvolumes based on concentration gradients. This recent method achieved a marked improvement in simulation speed and reduction in the number of time-steps required to complete a simulation run, compared with the exact algorithm, by sampling only the net diffusion events, instead of sampling all diffusion events. Although the spatial direct method with gradient-based diffusion gives accurate means of simulation ensembles, its gradient-based diffusion strategy results in reduced fluctuations in populations of diffusive species. In this paper, we present a new improved algorithm that is able to anticipate all possible microscopic fluctuations due to diffusive transfers in the system and incorporate this information to retain the same degree of fluctuations in populations of diffusing species as the exact algorithm. The new algorithm also provides a capability to set the desired level of fluctuation per diffusing species, which facilitates adjusting the balance between the degree of exactness in simulation results and the simulation speed. We present numerical results that illustrate the recovery of fluctuations together with the accuracy and efficiency of the new algorithm. [ABSTRACT FROM AUTHOR]

The zero-dipole summation method was extended to general molecular systems, and then applied to molecular dynamics simulations of an isotropic water system. In our previous paper [I. Fukuda, Y. Yonezawa, and H. Nakamura, J. Chem. Phys. 134, 164107 (2011)], for evaluating the electrostatic energy of a classical particle system, we proposed the zero-dipole summation method, which conceptually prevents the nonzero-charge and nonzero-dipole states artificially generated by a simple cutoff truncation. Here, we consider the application of this scheme to molecular systems, as well as some fundamental aspects of general cutoff truncation protocols. Introducing an idea to harmonize the bonding interactions and the electrostatic interactions in the scheme, we develop a specific algorithm. As in the previous study, the resulting energy formula is represented by a simple pairwise function sum, enabling facile applications to high-performance computation. The accuracy of the electrostatic energies calculated by the zero-dipole summation method with the atom-based cutoff was numerically investigated, by comparison with those generated by the Ewald method. We obtained an electrostatic energy error of less than 0.01% at a cutoff length longer than 13 Å for a TIP3P isotropic water system, and the errors were quite small, as compared to those obtained by conventional truncation methods. The static property and the stability in an MD simulation were also satisfactory. In addition, the dielectric constants and the distance-dependent Kirkwood factors were measured, and their coincidences with those calculated by the particle mesh Ewald method were confirmed, although such coincidences are not easily attained by truncation methods. We found that the zero damping-factor gave the best results in a practical cutoff distance region. In fact, in contrast to the zero-charge scheme, the damping effect was insensitive in the zero-charge and zero-dipole scheme, in the molecular system we treated. We discussed the origin of this difference between the two schemes and the dependence of this fact on the physical system. The use of the zero damping-factor will enhance the efficiency of practical computations, since the complementary error function is not employed. In addition, utilizing the zero damping-factor provides freedom from the parameter choice, which is not trivial in the zero-charge scheme, and eliminates the error function term, which corresponds to the time-consuming Fourier part under the periodic boundary conditions. [ABSTRACT FROM AUTHOR]

In this paper, we present time-reversible simulation algorithms for rigid bodies in the quaternion representation. By advancing a time-reversible algorithm [Y. Kajima, M. Hiyama, S. Ogata, and T. Tamura, J. Phys. Soc. Jpn. 80, 114002 (2011)] that requires iterations in calculating the angular velocity at each time step, we propose two kinds of iteration-free fast time-reversible algorithms. They are easily implemented in codes. The codes are compared with that of existing algorithms through demonstrative simulation of a nanometer-sized water droplet to find their stability of the total energy and computation speeds. [ABSTRACT FROM AUTHOR]

We propose a parameter-free algorithm for the identification of nearest neighbors. The algorithm is very easy to use and has a number of advantages over existing algorithms to identify nearest-neighbors. This solid-angle based nearest-neighbor algorithm (SANN) attributes to each possible neighbor a solid angle and determines the cutoff radius by the requirement that the sum of the solid angles is 4π. The algorithm can be used to analyze 3D images, both from experiments as well as theory, and as the algorithm has a low computational cost, it can also be used 'on the fly' in simulations. In this paper, we describe the SANN algorithm, discuss its properties, and compare it to both a fixed-distance cutoff algorithm and to a Voronoi construction by analyzing its behavior in bulk phases of systems of carbon atoms, Lennard-Jones particles and hard spheres as well as in Lennard-Jones systems with liquid-crystal and liquid-vapor interfaces. [ABSTRACT FROM AUTHOR]

Mathematical and computational modeling are key tools in analyzing important biological processes in cells and living organisms. In particular, stochastic models are essential to accurately describe the cellular dynamics, when the assumption of the thermodynamic limit can no longer be applied. However, stochastic models are computationally much more challenging than the traditional deterministic models. Moreover, many biochemical systems arising in applications have multiple time-scales, which lead to mathematical stiffness. In this paper we investigate the numerical solution of a stochastic continuous model of well-stirred biochemical systems, the chemical Langevin equation. The chemical Langevin equation is a stochastic differential equation with multiplicative, non-commutative noise. We propose an adaptive stepsize algorithm for approximating the solution of models of biochemical systems in the Langevin regime, with small noise, based on estimates of the local error. The underlying numerical method is the Milstein scheme. The proposed adaptive method is tested on several examples arising in applications and it is shown to have improved efficiency and accuracy compared to the existing fixed stepsize schemes. [ABSTRACT FROM AUTHOR]

In biochemical reaction systems dominated by delays, the simulation speed of the stochastic simulation algorithm depends on the size of the wait queue. As a result, it is important to control the size of the wait queue to improve the efficiency of the simulation. An improved accelerated delay stochastic simulation algorithm for biochemical reaction systems with delays, termed the improved delay-leaping algorithm, is proposed in this paper. The update method for the wait queue is effective in reducing the size of the queue as well as shortening the storage and access time, thereby accelerating the simulation speed. Numerical simulation on two examples indicates that this method not only obtains a more significant efficiency compared with the existing methods, but also can be widely applied in biochemical reaction systems with delays. [ABSTRACT FROM AUTHOR]

Using computer simulations to model the folding of proteins into their native states is computationally expensive due to the extraordinarily low degeneracy of the ground state. In this paper, we develop an efficient way to sample these folded conformations using Wang Landau sampling coupled with the configurational bias method (which uses an unphysical 'temperature' that lies between the collapse and folding transition temperatures of the protein). This method speeds up the folding process by roughly an order of magnitude over existing algorithms for the sequences studied. We apply this method to study the adsorption of intrinsically disordered hydrophobic polar protein fragments on a hydrophobic surface. We find that these fragments, which are unstructured in the bulk, acquire secondary structure upon adsorption onto a strong hydrophobic surface. Apparently, the presence of a hydrophobic surface allows these random coil fragments to fold by providing hydrophobic contacts that were lost in protein fragmentation. [ABSTRACT FROM AUTHOR]

In the quest towards coarse-grained potentials and new water models, we present an extension of the force matching technique to parameterize an all-atom force field for rigid water. The methodology presented here allows to improve the matching procedure by first optimizing the weighting exponents present in the objective function. A new gauge for unambiguously evaluating the quality of the fit has been introduced; it is based on the root mean square difference of the distributions of target properties between reference data and fitted potentials. Four rigid water models have been parameterized; the matching procedure has been used to assess the role of the ghost atom in TIP4P-like models and of electrostatic damping. In the former case, burying the negative charge inside the molecule allows to fit better the torques. In the latter, since short-range interactions are damped, a better fit of the forces is obtained. Overall, the best performing model is the one with a ghost atom and with electrostatic damping. The approach shown in this paper is of general validity and could be applied to any matching algorithm and to any level of coarse graining, also for non-rigid molecules. [ABSTRACT FROM AUTHOR]

In recent years, computer simulations have become increasingly useful when trying to understand the complex dynamics of biochemical networks, particularly in stochastic systems. In such situations stochastic simulation is vital in gaining an understanding of the inherent stochasticity present, as these models are rarely analytically tractable. However, a stochastic approach can be computationally prohibitive for many models. A number of approximations have been proposed that aim to speed up stochastic simulations. However, the majority of these approaches are fundamentally serial in terms of central processing unit (CPU) usage. In this paper, we propose a novel simulation algorithm that utilises the potential of multi-core machines. This algorithm partitions the model into smaller sub-models. These sub-models are then simulated, in parallel, on separate CPUs. We demonstrate that this method is accurate and can speed-up the simulation by a factor proportional to the number of processors available. [ABSTRACT FROM AUTHOR]

Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule. [ABSTRACT FROM AUTHOR]

Stochastic simulation of coupled chemical reactions is often computationally intensive, especially if a chemical system contains reactions occurring on different time scales. In this paper, we introduce a multiscale methodology suitable to address this problem, assuming that the evolution of the slow species in the system is well approximated by a Langevin process. It is based on the conditional stochastic simulation algorithm (CSSA) which samples from the conditional distribution of the suitably defined fast variables, given values for the slow variables. In the constrained multiscale algorithm (CMA) a single realization of the CSSA is then used for each value of the slow variable to approximate the effective drift and diffusion terms, in a similar manner to the constrained mean-force computations in other applications such as molecular dynamics. We then show how using the ensuing Fokker-Planck equation approximation, we can in turn approximate average switching times in stochastic chemical systems. [ABSTRACT FROM AUTHOR]

The hydrodynamic interaction is an essential effect to consider in Brownian dynamics simulations of polymer and nanoparticle dilute solutions. Several mathematical approaches can be used to build Brownian dynamics algorithms with hydrodynamic interaction, the most common of them being the exact but time demanding Cholesky decomposition and the Chebyshev polynomial expansion. Recently, Geyer and Winter [J. Chem. Phys. 130, 1149051 (2009)] have proposed a new approximation to treat the hydrodynamic interaction that seems quite efficient and is increasingly used. So far, a systematic comparison among those approaches has not been clearly made. In this paper, several features and the efficiency of typical implementations of those approaches are evaluated by using bead-and-spring chain models. The different sensitivity to the bead overlap detected for the different implementations may be of interest to select the suitable algorithm for a given simulation. [ABSTRACT FROM AUTHOR]

In this paper, we show that a remarkably simple correction can be made to the equation of motion which governs the evolution of the electronic wavefunction over some prescribed nuclear trajectory in the fewest-switches surface hopping algorithm. This corrected electronic equation of motion can then be used in conjunction with traditional or modified surface hopping methods to calculate nonadiabatic effects in large systems. Although the correction adds no computational cost to the algorithm, it leads to a dramatic improvement in scattering probabilities for all model problems studied thus far. We show that this correction can be applied to one of Tully's original one-dimensional model problems or to a more sophisticated two-dimensional example and yields substantially greater accuracy than the traditional approach. [ABSTRACT FROM AUTHOR]

A controlled quantum system possesses a search landscape defined by the target physical objective as a function of the controls. This paper focuses on the landscape for the transition probability Pi → f between the states of a finite level quantum system. Traditionally, the controls are applied fields; here, we extend the notion of control to also include the Hamiltonian structure, in the form of time independent matrix elements. Level sets of controls that produce the same transition probability value are shown to exist at the bottom Pi → f = 0.0 and top Pi → f = 1.0 of the landscape with the field and/or Hamiltonian structure as controls. We present an algorithm to continuously explore these level sets starting from an initial point residing at either extreme value of Pi → f. The technique can also identify control solutions that exhibit the desirable properties of (a) robustness at the top and (b) the ability to rapidly rise towards an optimal control from the bottom. Numerical simulations are presented to illustrate the varied control behavior at the top and bottom of the landscape for several simple model systems. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a trajectory-based nonadiabatic dynamics algorithm which aims to correct the well-known overcoherence problem in Tully's popular fewest-switches surface hopping algorithm. Our simultaneous-trajectory surface hopping algorithm propagates a separate classical trajectory on each energetically accessible adiabatic surface. The divergence of these trajectories generates decoherence, which collapses the particle wavefunction onto a single adiabatic state. Decoherence is implemented without the need for any parameters, either empirical or adjustable. We apply our algorithm to several model problems and find a significant improvement over the traditional algorithm. [ABSTRACT FROM AUTHOR]

This paper examines the benefits of Michaelis-Menten model reduction techniques in stochastic tau-leaping simulations. Results show that although the conditions for the validity of the reductions for tau-leaping remain the same as those for the stochastic simulation algorithm (SSA), the reductions result in a substantial speed-up for tau-leaping under a different range of conditions than they do for SSA. The reason of this discrepancy is that the time steps for SSA and for tau-leaping are determined by different properties of system dynamics. [ABSTRACT FROM AUTHOR]

The stochastic simulation algorithm was introduced by Gillespie and in a different form by Kurtz. There have been many attempts at accelerating the algorithm without deviating from the behavior of the simulated system. The crux of the explicit τ-leaping procedure is the use of Poisson random variables to approximate the number of occurrences of each type of reaction event during a carefully selected time period, τ. This method is acceptable providing the leap condition, that no propensity function changes 'significantly' during any time-step, is met. Using this method there is a possibility that species numbers can, artificially, become negative. Several recent papers have demonstrated methods that avoid this situation. One such method classifies, as critical, those reactions in danger of sending species populations negative. At most, one of these critical reactions is allowed to occur in the next time-step. We argue that the criticality of a reactant species and its dependent reaction channels should be related to the probability of the species number becoming negative. This way only reactions that, if fired, produce a high probability of driving a reactant population negative are labeled critical. The number of firings of more reaction channels can be approximated using Poisson random variables thus speeding up the simulation while maintaining the accuracy. In implementing this revised method of criticality selection we make use of the probability distribution from which the random variable describing the change in species number is drawn. We give several numerical examples to demonstrate the effectiveness of our new method. [ABSTRACT FROM AUTHOR]

Typical multiscale biochemical models contain fast-scale and slow-scale reactions, where 'fast' reactions fire much more frequently than 'slow' ones. This feature often causes stiffness in discrete stochastic simulation methods such as Gillespie's algorithm and the Tau-Leaping method leading to inefficient simulation. This paper proposes a new strategy to automatically detect stiffness and identify species that cause stiffness for the Tau-Leaping method, as well as two stiffness reduction methods. Numerical results on a stiff decaying dimerization model and a heat shock protein regulation model demonstrate the efficiency and accuracy of the proposed methods for multiscale biochemical systems. [ABSTRACT FROM AUTHOR]

The accurate prediction of absolute protein-ligand binding free energies is one of the grand challenge problems of computational science. Binding free energy measures the strength of binding between a ligand and a protein, and an algorithm that would allow its accurate prediction would be a powerful tool for rational drug design. Here we present the development of a new method that allows for the absolute binding free energy of a protein-ligand complex to be calculated from first principles, using a single simulation. Our method involves the use of a novel reaction coordinate that swaps a ligand bound to a protein with an equivalent volume of bulk water. This water-swap reaction coordinate is built using an identity constraint, which identifies a cluster of water molecules from bulk water that occupies the same volume as the ligand in the protein active site. A dual topology algorithm is then used to swap the ligand from the active site with the identified water cluster from bulk water. The free energy is then calculated using replica exchange thermodynamic integration. This returns the free energy change of simultaneously transferring the ligand to bulk water, as an equivalent volume of bulk water is transferred back to the protein active site. This, directly, is the absolute binding free energy. It should be noted that while this reaction coordinate models the binding process directly, an accurate force field and sufficient sampling are still required to allow for the binding free energy to be predicted correctly. In this paper we present the details and development of this method, and demonstrate how the potential of mean force along the water-swap coordinate can be improved by calibrating the soft-core Coulomb and Lennard-Jones parameters used for the dual topology calculation. The optimal parameters were applied to calculations of protein-ligand binding free energies of a neuraminidase inhibitor (oseltamivir), with these results compared to experiment. These results demonstrate that the water-swap coordinate provides a viable and potentially powerful new route for the prediction of protein-ligand binding free energies. [ABSTRACT FROM AUTHOR]

In this paper, we present the implementation of efficient approximations to time-dependent density functional theory (TDDFT) within the Tamm-Dancoff approximation (TDA) for hybrid density functionals. For the calculation of the TDDFT/TDA excitation energies and analytical gradients, we combine the resolution of identity (RI-J) algorithm for the computation of the Coulomb terms and the recently introduced 'chain of spheres exchange' (COSX) algorithm for the calculation of the exchange terms. It is shown that for extended basis sets, the RIJCOSX approximation leads to speedups of up to 2 orders of magnitude compared to traditional methods, as demonstrated for hydrocarbon chains. The accuracy of the adiabatic transition energies, excited state structures, and vibrational frequencies is assessed on a set of 27 excited states for 25 molecules with the configuration interaction singles and hybrid TDDFT/TDA methods using various basis sets. Compared to the canonical values, the typical error in transition energies is of the order of 0.01 eV. Similar to the ground-state results, excited state equilibrium geometries differ by less than 0.3 pm in the bond distances and 0.5° in the bond angles from the canonical values. The typical error in the calculated excited state normal coordinate displacements is of the order of 0.01, and relative error in the calculated excited state vibrational frequencies is less than 1%. The errors introduced by the RIJCOSX approximation are, thus, insignificant compared to the errors related to the approximate nature of the TDDFT methods and basis set truncation. For TDDFT/TDA energy and gradient calculations on Ag-TB2-helicate (156 atoms, 2732 basis functions), it is demonstrated that the COSX algorithm parallelizes almost perfectly (speedup ∼26-29 for 30 processors). The exchange-correlation terms also parallelize well (speedup ∼27-29 for 30 processors). The solution of the Z-vector equations shows a speedup of ∼24 on 30 processors. The parallelization efficiency for the Coulomb terms can be somewhat smaller (speedup ∼15-25 for 30 processors), but their contribution to the total calculation time is small. Thus, the parallel program completes a Becke3-Lee-Yang-Parr energy and gradient calculation on the Ag-TB2-helicate in less than 4 h on 30 processors. We also present the necessary extension of the Lagrangian formalism, which enables the calculation of the TDDFT excited state properties in the frozen-core approximation. The algorithms described in this work are implemented into the ORCA electronic structure system. [ABSTRACT FROM AUTHOR]

In this paper we propose a new quadrature scheme for computing vibrational spectra and apply it, using a Lanczos algorithm, to CH3CN. All 12 coordinates are treated explicitly. We need only 157'419'523 quadrature points. It would not be possible to use a product Gauss grid because 33 853 318 889 472 product Gauss points would be required. The nonproduct quadrature we use is based on ideas of Smolyak, but they are extended so that they can be applied when one retains basis functions θn1(r1)...θnD(rD) that satisfy the condition α1n1 + ··· + αDnD <= b, where the αk are integers. We demonstrate that it is possible to exploit the structure of the grid to efficiently evaluate the matrix-vector products required to use the Lanczos algorithm. [ABSTRACT FROM AUTHOR]

We propose the thermodynamic integration along a spatial reaction coordinate using the molecular dynamics simulation combined with the three-dimensional reference interaction site model theory. This method provides a free energy calculation in solution along the reaction coordinate defined by the Cartesian coordinates of the solute atoms. The proposed method is based on the blue moon algorithm which can, in principle, handle any reaction coordinate as far as it is defined by the solute atom positions. In this article, we apply the present method to the complex formation process of the crown ether 18-Crown-6 (18C6) with the potassium ion in an aqueous solution. The separation between the geometric centers of these two molecules is taken to be the reaction coordinate for this system. The potential of mean force (PMF) becomes the maximum at the separation between the molecular centers being ∼4 Å, which can be identified as the free energy barrier in the process of the molecular recognition. In a separation further than the free energy barrier, the PMF is slightly reduced to exhibit a plateau. In the region closer than the free energy barrier, approach of the potassium ion to the center of 18C6 also decreases the PMF. When the potassium ion is accommodated at the center of 18C6, the free energy is lower by -5.7 ± 0.7 kcal/mol than that at the above mentioned plateau or converged state. By comparing the results with those from the free energy calculation along the coupling parameters obtained in our previous paper [T. Miyata, Y. Ikuta, and F. Hirata, J. Chem. Phys. 133, 044114 (2010)], it is found that the effective interaction in water between 18C6 and the potassium ion vanishes beyond the molecular-center-separation of 10 Å. Furthermore, the conformation of 18C6 is found to be significantly changed depending upon the 18C6-K+ distance. A proper conformational sampling and an accurate solvent treatment are crucial for realizing the accurate PMF, and we believe that the proposed method is useful to evaluate the PMF in a solution. A discussion upon the PMF in terms of the three-dimensional distribution function for the solvent is also presented. [ABSTRACT FROM AUTHOR]

In this paper we report transition frequencies and line strengths computed for H2O-H2 and compare with the experimental observations of [M. J. Weida and D. J. Nesbitt, J. Chem. Phys. 110, 156 (1999)]. To compute the spectra we use a symmetry adapted Lanczos algorithm and an uncoupled product basis set. Our results corroborate the assignments of Weida and Nesbitt and there is good agreement between calculated and observed transitions. Possible candidates for lines that Weida and Nesbitt were not able to assign are presented. Several other bands that may be observable are also discovered. Although all the observed bands are associated with states localized near the global potential minimum, at which H2O acts as proton acceptor, a state with significant amplitude near the T-shape secondary potential minimum at which H2O acts as proton donor is identified by examining many different probability density plots. [ABSTRACT FROM AUTHOR]

As originally proposed, the fewest switches surface hopping (FSSH) algorithm does not allow for decoherence between wavefunction amplitudes on different adiabatic surfaces. In this paper, we propose an inexpensive correction to standard FSSH dynamics wherein we explicitly model the decoherence of nuclear wave packets on distinct electronic surfaces. Our augmented fewest switches surface hopping approach is conceptually simple and, thus far, it has allowed us to capture several key features of the exact quantum results. Two points in particular merit attention. First, we obtain the correct branching ratios when a quantum particle passes through more than one region of nonadiabatic coupling. Second, our formalism provides a new and natural approach for rescaling nuclear momenta after a surface hop. Both of these features should become increasingly important as surface hopping schemes are applied to higher-dimensional problems. [ABSTRACT FROM AUTHOR]

Biological channels permeate ions through cell membranes. Ion channels carry a permanent charge that has a significant role in determining channel's permeation properties such as selectivity to certain ions, current amplitude, etc. In this paper we deal with the determination of the permanent charge from current-voltage curves. The ion channel current behavior is modelled by Poisson-Nernst-Planck (PNP) equations system. Previous works on the fixed charge density identification problem contain several ill-posed steps and linearization of the nonlinear PNP system. We suggest here several methods to make these algorithms more stable and accurate. [ABSTRACT FROM AUTHOR]

The use of discrete variable representation (DVR) basis sets within ab initio molecular dynamics calculations allows the latter to be performed with converged energies and, more importantly, converged forces. In this paper, we show how to carry out ab initio molecular dynamics calculations in the isothermal-isobaric ensemble with fully flexible simulation boxes within the DVR basis set framework. In particular, we derive the appropriate DVR based expression for the pressure tensor when the electronic structure is represented using Kohn-Sham density functional theory, and we examine the convergence of this expression as a function of the basis set size. An illustrative example using 64 silicon atoms in a fully flexible box using a combination of the Martyna-Tobias-Klein [Martyna et al., J. Chem. Phys. 101, 4177 (1994)] and Car-Parrinello [Car and Parinello, Phys. Rev. Lett. 55, 2471 (1985)] algorithms is presented to demonstrate the efficacy of the approach. [ABSTRACT FROM AUTHOR]

The weighted stochastic simulation algorithm (wSSA) was developed by Kuwahara and Mura [J. Chem. Phys. 129, 165101 (2008)] to efficiently estimate the probabilities of rare events in discrete stochastic systems. The wSSA uses importance sampling to enhance the statistical accuracy in the estimation of the probability of the rare event. The original algorithm biases the reaction selection step with a fixed importance sampling parameter. In this paper, we introduce a novel method where the biasing parameter is state-dependent. The new method features improved accuracy, efficiency, and robustness. [ABSTRACT FROM AUTHOR]

Two iterative procedures have been proposed recently to calculate the chemical potentials corresponding to prescribed concentrations from grand canonical Monte Carlo (GCMC) simulations. Both are based on repeated GCMC simulations with updated excess chemical potentials until the desired concentrations are established. In this paper, we propose combining our robust and fast converging iteration algorithm [Malasics, Gillespie, and Boda, J. Chem. Phys. 128, 124102 (2008)] with the suggestion of Lamperski [Mol. Simul. 33, 1193 (2007)] to average the chemical potentials in the iterations (instead of just using the chemical potentials obtained in the last iteration). We apply the unified method for various electrolyte solutions and show that our algorithm is more efficient if we use the averaging procedure. We discuss the convergence problems arising from violation of charge neutrality when inserting/deleting individual ions instead of neutral groups of ions (salts). We suggest a correction term to the iteration procedure that makes the algorithm efficient to determine the chemical potentials of individual ions too. [ABSTRACT FROM AUTHOR]

We present a new algorithm for mixed quantum-classical dynamics that helps bridge the gap between mean-field (Ehrenfest) and surface-hopping dynamics by defining a natural rate of decoherence. In order to derive this decoherence result, we have expanded the number of independent variables in the usual Ehrenfest routine so that mixed quantum-classical derivatives are now propagated in time alongside the usual Ehrenfest variables. Having done so, we compute a unique rate of decoherence using two independent approaches: (i) by comparing the equations of motion for the joint nuclear-electronic probability density in phase space according to Ehrenfest dynamics versus partial Wigner transform dynamics and (ii) by introducing a frozen Gaussian interpretation of Ehrenfest dynamics which allows nuclear wave packets to separate. The first consequence of this work is a means to rigorously check the accuracy of standard Ehrenfest dynamics. Second, this paper suggests a nonadiabatic dynamics algorithm, whereby the nuclei are propagated on the mean-field (Ehrenfest) potential energy surface and undergo stochastic decoherence events. Our work resembles the surface-hopping algorithm of Schwartz and co-workers [J. Chem. Phys. 123, 234106 (2005)]—only now without any adjustable parameters. For the case of two electronic states, we present numerical results on the so-called “Tully problems” and emphasize that future numerical benchmarking is still needed. Future work will also treat the problem of three or more electronic states. [ABSTRACT FROM AUTHOR]

The direct approach to gravitation and electrostatics (DAGE) algorithm is an accurate, efficient, and flexible method for calculating electrostatic potentials. In this paper, we show that the algorithm can be easily extended to consider systems with many different kinds of periodicities, such as crystal lattices, surfaces, or wires. The accuracy and performance are nearly the same for periodic and aperiodic systems. The electrostatic potential for semiperiodic systems, namely defects in crystal lattices, can be obtained by combining periodic and aperiodic calculations. The method has been applied to an ionic model system mimicking NaCl, and to a corresponding covalent model system. [ABSTRACT FROM AUTHOR]

Gillespie’s direct method (DM) [D. Gillespie, J. Chem. Phys. 81, 2340 (1977)] for exact stochastic simulation of chemical reaction systems has been widely adopted. It is easy to implement but requires large computation for relatively large systems. Recently, two more efficient methods, next reaction method (NRM) [M. A. Gibson and J. Bruck, J. Phys. Chem. A 105, 1876 (2000)] and optimized DM (ODM) [Y. Cao et al., J. Chem. Phys. 121, 4059 (2004)], have been developed to improve simulation speed. It has been demonstrated that the ODM is the state-of-the-art most efficient method for exact stochastic simulation of most practical reaction systems. In this paper, we first develop an exact stochastic simulation algorithm named ODMK that is more efficient than the ODM. We then develop an approximate method named K-skip method to further accelerate simulation. Using two chemical reaction systems, we demonstrate that our ODMK and K-skip method can save 20%–30% and 70%–80% simulation time, respectively, comparing to the ODM. We also show that our ODMK and K-skip method provide almost the same simulation accuracy as the ODM. [ABSTRACT FROM AUTHOR]

In this paper, we construct a phase-space surface hopping algorithm for use in systems that exhibit strong nonadiabatic coupling. The algorithm is derived from a representation of the electronic basis which is a function of the nuclear phase-space coordinates rather than the nuclear position coordinates. This phase-space adiabatic basis can be understood in the context of Berry’s superadiabatic basis formalism as the first-order superadiabatic correction to the conventional position-space adiabatic basis. This superadiabatic representation leads to nuclear dynamics described not by Newton’s equations of motion but by generalized Hamilton’s equations of motion. The phase-space surface hopping algorithm captures physical effects that cannot be described by traditional algorithms. For a simple model problem, we show that phase-space surface hopping is more accurate than position-space surface hopping, especially when the nonadiabatic coupling is strong. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of simplifying chemical reaction networks by adroitly reducing the number of reaction channels and chemical species. The analysis adopts a discrete-stochastic point of view and focuses on the model reaction set S1≤=≥S2→S3, whose simplicity allows all the mathematics to be done exactly. The advantages and disadvantages of replacing this reaction set with a single S3-producing reaction are analyzed quantitatively using novel criteria for measuring simulation accuracy and simulation efficiency. It is shown that in all cases in which such a model reduction can be accomplished accurately and with a significant gain in simulation efficiency, a procedure called the slow-scale stochastic simulation algorithm provides a robust and theoretically transparent way of implementing the reduction [ABSTRACT FROM AUTHOR]

The complexity of 1H NMR spectra of solutes in partially ordered solvents such as liquid crystals increases rapidly with the number of spins. Spectra of simple solutes with sufficient symmetry and containing not too many spins (typically ≤8) are readily analyzed. The analysis of larger spin systems is more difficult, and often impossible. In this paper we present the application of a general automated evolutionary algorithm to solve the highly complex proton NMR spectrum of the 12-spin system pentane, a solute that interconverts rapidly among several symmetry-unrelated conformations. The interpretation of the spectral parameters that are obtained from the analysis requires the use of a model to connect relative orientational orders in symmetry-unrelated conformers. [ABSTRACT FROM AUTHOR]

We describe a new grid-based (or localized orbital-based) method for treating the effects of exchange and correlation on electronic transmission through a molecular target where there are initially other bound electrons. Our algorithm combines the approaches of (i) solid-state grid-based algorithms using self-energies and (ii) the complex Kohn method from electron-molecule scattering. For the general problem of a molecular target with n-electrons, our algorithm should ideally solve for electronic transmission with a computational cost scaling as n2, although the present implementation is limited to one-dimensional problems. In this paper, we implement our algorithm to solve three one-dimensional model problems involving two electrons: (i) Single-channel resonant transmission through a double-barrier well (DBW), where the target already contains one bound-state electron [Rejec et al., Phys. Rev. B 67, 075311 (2003)]; (ii) multichannel resonant transmission through a DBW, where the incoming electron can exchange energy with the bound electron; (iii) transmission through a triple-barrier well (TBW), where the incoming electron can knock forward the bound electron, yielding a physical model of electron-assisted electron transfer. This article offers some insight about the role and size of exchange and correlation effects in molecular conduction, where few such rigorous calculations have yet been made. Such multibody effects have already been experimentally identified in mesoscopic electron transport, giving rise to the “0.7 anomaly,” whereby electrons traveling through a narrow channel pair up as singlets and triplets. We expect the effect of electronic correlation to be even more visible for conduction through molecules, where electrons should partially localize into bonding and antibonding orbitals. [ABSTRACT FROM AUTHOR]

Open-system quantum optimal control theory for optical control of the dynamics of a quantum system in contact with a dissipative bath is used here for explicitly time-dependent target operators, O⁁(t). Global and local control strategies are combined in a novel algorithm by defining a set of time slices, into which the total control time is subdivided. The optimization then proceeds locally forward in time from subinterval to subinterval, while within each subinterval global control theory is used with iterative forward-backward propagation. The subintervals are connected by appropriate boundary conditions. In the present paper, all operators are represented in the basis of the eigenstates of the field-free system Hamiltonian. The algorithm is first applied to and its computational performance tested for a two-level system with energy and phase relaxation, and later extended to a many-level model. Model parameters are chosen to represent the IR pulse excitation of the adsorbate-surface stretch mode of vibrationally relaxing CO on a Cu(100) surface. Various time-dependent targets are formulated to achieve (i) population inversion, (ii) the creation of a wavepacket, and (iii) overtone excitation by “ladder climbing.” [ABSTRACT FROM AUTHOR]

Local coupled-cluster theory provides an algorithm for measuring electronic correlation quickly, using only the spatial locality of localized electronic orbitals. Previously, we showed [J. Subotnik et al., J. Chem. Phys. 125, 074116 (2006)] that one may construct a local coupled-cluster singles-doubles theory which (i) yields smooth potential energy surfaces and (ii) achieves near linear scaling. That theory selected which orbitals to correlate based only on the distances between the centers of different, localized orbitals, and the approximate potential energy surfaces were characterized as smooth using only visual identification. This paper now extends our previous algorithm in three important ways. First, locality is now based on both the distances between the centers of orbitals as well as the spatial extent of the orbitals. We find that, by accounting for the spatial extent of a delocalized orbital, one can account for electronic correlation in systems with some electronic delocalization using fast correlation methods designed around orbital locality. Second, we now enforce locality on not just the amplitudes (which measure the exact electron-electron correlation), but also on the two-electron integrals themselves (which measure the bare electron-electron interaction). Our conclusion is that we can bump integrals as well as amplitudes, thereby gaining a tremendous increase in speed and paradoxically increasing the accuracy of our LCCSD approach. Third and finally, we now make a rigorous definition of chemical smoothness as requiring that potential energy surfaces not support artificial maxima, minima, or inflection points. By looking at first and second derivatives from finite difference techniques, we demonstrate complete chemical smoothness of our potential energy surfaces (bumping both amplitudes and integrals). These results are significant both from a theoretical and from a computationally practical point of view. [ABSTRACT FROM AUTHOR]

Algorithmic improvements of the dimer method [G. Henkelman and H. Jónsson, J. Chem. Phys. 111, 7010 (1999)] are described in this paper. Using the limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) optimizer for the dimer translation greatly improves the convergence compared to the previously used conjugate gradient algorithm. It also saves one energy and gradient calculation per dimer iteration. Extrapolation of the gradient during repeated dimer rotations reduces the computational cost to one gradient calculation per dimer rotation. The L-BFGS algorithm also improves convergence of the rotation. Thus, three to four energy and gradient evaluations are needed per iteration at the beginning of a transition state search, while only two are required close to convergence. Moreover, we apply the dimer method in internal coordinates to reduce coupling between the degrees of freedom. Weighting the coordinates can be used to apply chemical knowledge about the system and restrict the transition state search to only part of the system while minimizing the remainder. These improvements led to an efficient method for the location of transition states without the need to calculate the Hessian. Thus, it is especially useful in large systems with expensive gradient evaluations. [ABSTRACT FROM AUTHOR]

Chemical reaction systems with a low to moderate number of molecules are typically modeled as discrete jump Markov processes. These systems are oftentimes simulated with methods that produce statistically exact sample paths such as the Gillespie algorithm or the next reaction method. In this paper we make explicit use of the fact that the initiation times of the reactions can be represented as the firing times of independent, unit rate Poisson processes with internal times given by integrated propensity functions. Using this representation we derive a modified next reaction method and, in a way that achieves efficiency over existing approaches for exact simulation, extend it to systems with time dependent propensities as well as to systems with delays. [ABSTRACT FROM AUTHOR]

This paper focuses on the temporal discretization of the Langevin dynamics, and on different resulting numerical integration schemes. Using a method based on the exponentiation of time dependent operators, we carefully derive a numerical scheme for the Langevin dynamics, which we found equivalent to the proposal of Ermak and Buckholtz [J. Comput. Phys. 35, 169 (1980)] and not simply to the stochastic version of the velocity-Verlet algorithm. However, we checked on numerical simulations that both algorithms give similar results, and share the same “weak order two” accuracy. We then apply the same strategy to derive and test two numerical schemes for the dissipative particle dynamics. The first one of them was found to compare well, in terms of speed and accuracy, with the best currently available algorithms. [ABSTRACT FROM AUTHOR]

In this paper the authors address the problem of internal consistency in trajectory surface hopping methods, i.e., the requirement that the fraction of trajectories running on each electronic state equals the probabilities computed by the electronic time-dependent Schrödinger equation, after averaging over all trajectories. They derive a formula for the hopping probability in Tully’s “fewest switches” spirit that would yield a rigorously consistent treatment. They show the relationship of Tully’s widely used surface hopping algorithm with the “exact” prescription that cannot be applied when running each trajectory independently. They also bring out the connection of the consistency problem with the coherent propagation of the electronic wave function and the artifacts caused by coherent Rabi-type oscillations of the state probabilities in weak coupling regimes. A real molecule (azobenzene) and two ad hoc models serve as examples to illustrate the above theoretical arguments. Following a proposal by Truhlar’s group [Zhu et al., J. Chem. Phys. 121, 7658 (2004) Zhu et al., J. Chem. Theory Comput. 1, 527 (2005)], they apply a decoherence correction to the state probabilities, in conjunction with Tully’s algorithm, and they obtain satisfactory results in terms of internal consistency and of agreement with the outcomes of quantum wave packet calculations. [ABSTRACT FROM AUTHOR]

Density functional theory as proposed by Rosenfeld [Phys. Rev. Lett. 63, 980 (1989)] is used to study hard sphere mixture exposed by cylindrically symmetric external field. Exploiting the symmetry of the system, explicit formulas for the weighted densities are derived. The resulting density profiles are compared with new grand canonical Monte Carlo simulations. The comparison reveals very good agreement between the predicted and simulated results even at high densities and very narrow pores. Finally, simple algorithms for computing complete elliptic functions of the first and second kinds that occur in the derived formulae are presented to make the paper self-contained. [ABSTRACT FROM AUTHOR]

An approach is developed in the replica exchange framework to enhance conformational sampling for the quantum mechanical (QM) potential based molecular dynamics simulations. Importantly, with our enhanced sampling treatment, a decent convergence for electronic structure self-consistent-field calculation is robustly guaranteed, which is made possible in our replica exchange design by avoiding direct structure exchanges between the QM-related replicas and the activated (scaled by low scaling parameters or treated with high “effective temperatures”) molecular mechanical (MM) replicas. Although the present approach represents one of the early efforts in the enhanced sampling developments specifically for quantum mechanical potentials, the QM-based simulations treated with the present technique can possess the similar sampling efficiency to the MM based simulations treated with the Hamiltonian replica exchange method (HREM). In the present paper, by combining this sampling method with one of our recent developments (the dual-topology alchemical HREM approach), we also introduce a method for the sampling enhanced QM-based free energy calculations. [ABSTRACT FROM AUTHOR]

In this paper, we present a path integral hybrid Monte Carlo (PIHMC) method for rotating molecules in quantum fluids. This is an extension of our PIHMC for correlated Bose fluids [S. Miura and J. Tanaka, J. Chem. Phys. 120, 2160 (2004)] to handle the molecular rotation quantum mechanically. A novel technique referred to be an effective potential of quantum rotation is introduced to incorporate the rotational degree of freedom in the path integral molecular dynamics or hybrid Monte Carlo algorithm. For a permutation move to satisfy Bose statistics, we devise a multilevel Metropolis method combined with a configurational-bias technique for efficiently sampling the permutation and the associated atomic coordinates. Then, we have applied the PIHMC to a helium-4 cluster doped with a carbonyl sulfide molecule. The effects of the quantum rotation on the solvation structure and energetics were examined. Translational and rotational fluctuations of the dopant in the superfluid cluster were also analyzed. [ABSTRACT FROM AUTHOR]

In this paper, we introduce algorithms based on Fourier synthesis for designing phase compensating rf pulse sequences for high-resolution nuclear magnetic resonance (NMR) spectroscopy in an inhomogeneous B0 field. We show that using radio frequency pulses and time varying linear gradients in three dimensions, it is possible to impart the transverse magnetization of spins phase, which is a desired function of the spatial (x,y,z) location. Such a sequence can be used to precompensate the phase that will be acquired by spins at different spatial locations due to inhomogeneous magnetic fields. With this precompensation, the chemical shift information of the spins can be reliably extracted and high resolution NMR spectrum can be obtained. [ABSTRACT FROM AUTHOR]

The fifth-order two-dimensional (2D) Raman signals have been calculated from the equilibrium and nonequilibrium (finite field) molecular dynamics simulations. The equilibrium method evaluates response functions with equilibrium trajectories, while the nonequilibrium method calculates a molecular polarizability from nonequilibrium trajectories for different pulse configurations and sequences. In this paper, we introduce an efficient algorithm which hybridizes the existing two methods to avoid the time-consuming calculations of the stability matrices which are inherent in the equilibrium method. Using nonequilibrium trajectories for a single laser excitation, we are able to dramatically simplify the sampling process. With this approach, the 2D Raman signals for liquid xenon, carbon disulfide, water, acetonitrile, and formamide are calculated and discussed. Intensities of 2D Raman signals are also estimated and the peak strength of formamide is found to be only five times smaller than that of carbon disulfide. [ABSTRACT FROM AUTHOR]

Internally contracted state-specific multireference (MR) algorithms, either perturbative such as CASPT2 or NEVPT2, or nonperturbative such as contracted MR configuration interaction or MR coupled cluster, are computationally efficient but they may suffer from the internal contraction of the wave function in the reference space. The use of a low dimensional multistate model space only offers limited flexibility and is not always practicable. The present paper suggests a convenient state-specific procedure to decontract the reference part of the wave function from a series of state-specific calculations using slightly perturbed zero-order wave functions. The method provides an orthogonal valence bond reading of the ground state and an effective valence Hamiltonian, the excited roots of which are shown to be relevant. The orthogonal valence bond functions can be considered quasidiabatic states and the effective valence Hamiltonian gives therefore the quasidiabatic energies and the electronic coupling among the quasidiabatic states. The efficiency of the method is illustrated in two case problems where the dynamical correlation plays a crucial role, namely, the LiF neutral/ionic avoided crossing and the F2 ground state wave function. [ABSTRACT FROM AUTHOR]

We provide a rigorous proof that the Hohenberg-Kohn theorem holds for spin densities by extending Lieb’s Legendre-transform formulation to spin densities. The resulting spin-density-functional theory resolves several troublesome issues. Most importantly, the present paper provides an explicit construction for the spin potentials at any point along the adiabatic connection curve, thus providing a formal basis for the use of exchange-correlation functionals of the spin density in the Kohn-Sham density-functional theory (DFT). The practical implications of this result for unrestricted Kohn-Sham DFT calculations is considered, and the existence of holes below the Fermi level is discussed. We argue that an orbital’s energy tends to increase as its occupation number increases, which provides the basis for a computational algorithm for determining the occupation numbers in Kohn-Sham DFT and helps explain the origin of Hund’s rules and holes below the Fermi level. [ABSTRACT FROM AUTHOR]