Search NASA⌕ Search

Engineering topics

Mehta, Dhagash

Publications and source records attributed to Mehta, Dhagash.

Communication: Newton homotopies for sampling stationary points of potential energy landscapes

One of the most challenging and frequently arising problems in many areas of science is to find solutions of a system of multivariate nonlinear equations. There are several numerical methods that can find many (or all if the system is small enough) solutions but they all exhibit characteristic problems. Moreover, traditional methods can break down if the system contains singular solutions. Here, we propose an efficient implementation of Newton homotopies, which can sample a large number of the stationary points of complicated many-body potentials. We demonstrate how the procedure works by applying it to the nearest-neighbor ϕ{sup 4} model and atomic clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Certification and the potential energy landscape

Typically, there is no guarantee that a numerical approximation obtained using standard nonlinear equation solvers is indeed an actual solution, meaning that it lies in the quadratic convergence basin. Instead, it may lie only in the linear convergence basin, or even in a chaotic region, and hence not converge to the corresponding stationary point when further optimization is attempted. In some cases, these non-solutions could be misleading. Proving that a numerical approximation will quadratically converge to a stationary point is termed certification. In this report, we provide details of how Smale's α-theory can be used to certify numerically obtained stationary points of a potential energy landscape, providing a mathematical proof that the numerical approximation does indeed correspond to an actual stationary point, independent of the precision employed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An inversion-relaxation approach for sampling stationary points of spin model Hamiltonians

Sampling the stationary points of a complicated potential energy landscape is a challenging problem. Here, we introduce a sampling method based on relaxation from stationary points of the highest index of the Hessian matrix. We illustrate how this approach can find all the stationary points for potentials or Hamiltonians bounded from above, which includes a large class of important spin models, and we show that it is far more efficient than previous methods. For potentials unbounded from above, the relaxation part of the method is still efficient in finding minima and transition states, which are usually the primary focus of attention for atomistic systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Stationary point analysis of the one-dimensional lattice Landau gauge fixing functional, aka random phase XY Hamiltonian

Research Highlights: > Exact results for all stationary points of some high-dimensional function are given. > They are interpreted as Gribov copies of a lattice Landau gauge fixing functional. > The Gribov ambiguity and the Neuberger problem in compact U(1) are illustrated. > Stationary points are used to discuss a criterion on the absence of phase transitions. - Abstract: We study the stationary points of what is known as the lattice Landau gauge fixing functional in one-dimensional compact U(1) lattice gauge theory, or as the Hamiltonian of the one-dimensional random phase XY model in statistical physics. An analytic solution of all stationary points is derived for lattices with an odd number of lattice sites and periodic boundary conditions. In the context of lattice gauge theory, these stationary points and their indices are used to compute the gauge fixing partition function, making reference in particular to the Neuberger problem. Interpreted as stationary points of the one-dimensional XY Hamiltonian, the solutions and their Hessian determinants allow us to evaluate a criterion which makes predictions on the existence of phase transitions and the corresponding critical energies in the thermodynamic limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Polynomial Homotopy Continuation Method and String Vacua

Finding vacua for the four-dimensional effective theories for supergravity which descend from flux compactifications and analyzing them according to their stability is one of the central problems in string phenomenology. Except for some simple toy models, it is, however, difficult to find all the vacua analytically. Recently developed algorithmic methods based on symbolic computer algebra can be of great help in the more realistic models. However, they suffer from serious algorithmic complexities and are limited to small system sizes. In this paper, we review a numerical method called the numerical polynomial homotopy continuation (NPHC) method, first used in the areas of lattice field theories, which by construction finds all of the vacua of a given potential that is known to have only isolated solutions. The NPHC method is known to suffer from no major algorithmic complexities and is embarrassingly parallelizable , and hence its applicability goes way beyond the existing symbolic methods. We first solve a simple toy model as a warm-up example to demonstrate the NPHC method at work. We then show that all the vacua of a more complicated model of a compactified M theory model, which has an S U ( 3 ) structure, can be obtained by using a desktop machine in just about an hour, a feat which was reported to be prohibitively difficult by the existing symbolic methods. Finally, we compare the various technicalities between the two methods.

Mehta, Dhagash↗