Computation of Ground States of the Gross-Pitaevskii Functional via Riemannian Optimization

In this paper we combine concepts from Riemannian Optimization and the theory of Sobolev gradients to derive a new conjugate gradient method for direct minimization of the Gross-Pitaevskii energy functional with rotation. The conservation of the number of particles constrains the minimizers to lie on a manifold corresponding to the unit $L^2$ norm. The idea developed here is to transform the original constrained optimization problem to an unconstrained problem on this (spherical) Riemannian manifold, so that fast minimization algorithms can be applied as alternatives to more standard constrained formulations. First, we obtain Sobolev gradients using an equivalent definition of an $H^1$ inner product which takes into account rotation. Then, the Riemannian gradient (RG) steepest descent method is derived based on projected gradients and retraction of an intermediate solution back to the constraint manifold. Finally, we use the concept of the Riemannian vector transport to propose a Riemannian conjugate gradient (RCG) method for this problem. It is derived at the continuous level based on the "optimize-then-discretize" paradigm instead of the usual "discretize-then-optimize" approach, as this ensures robustness of the method when adaptive mesh refinement is performed in computations. We evaluate various design choices inherent in the formulation of the method and conclude with recommendations concerning selection of the best options. Numerical tests demonstrate that the proposed RCG method outperforms the simple gradient descent (RG) method in terms of rate of convergence. While on simple problems a Newton-type method implemented in the {\tt Ipopt} library exhibits a faster convergence than the (RCG) approach, the two methods perform similarly on more complex problems requiring the use of mesh adaptation. At the same time the (RCG) approach has far fewer tunable parameters.Comment: 28 pages, 13 figure

A discrete, unitary, causal theory of quantum gravity

A discrete model of Lorentzian quantum gravity is proposed. The theory is completely background free, containing no reference to absolute space, time, or simultaneity. The states at one slice of time are networks in which each vertex is labelled with two arrows, which point along an adjacent edge, or to the vertex itself. The dynamics is specified by a set of unitary replacement rules, which causally propagate the local degrees of freedom. The inner product between any two states is given by a sum over histories. Assuming it converges (or can be Abel resummed), this inner product is proven to be hermitian and fully gauge-degenerate under spacetime diffeomorphisms. At least for states with a finite past, the inner product is also positive. This allows a Hilbert space of physical states to be constructed.Comment: 38 pages, 9 figures, v3 added to exposition and references, v4 expanded prospects sectio

Div First-Order System LL* (FOSLL*) for Second-Order Elliptic Partial Differential Equations

The first-order system LL* (FOSLL*) approach for general second-order elliptic partial differential equations was proposed and analyzed in [10], in order to retain the full efficiency of the L2 norm first-order system least-squares (FOSLS) ap- proach while exhibiting the generality of the inverse-norm FOSLS approach. The FOSLL* approach in [10] was applied to the div-curl system with added slack vari- ables, and hence it is quite complicated. In this paper, we apply the FOSLL* approach to the div system and establish its well-posedness. For the corresponding finite ele- ment approximation, we obtain a quasi-optimal a priori error bound under the same regularity assumption as the standard Galerkin method, but without the restriction to sufficiently small mesh size. Unlike the FOSLS approach, the FOSLL* approach does not have a free a posteriori error estimator, we then propose an explicit residual error estimator and establish its reliability and efficiency bound

Rigidity of spherical codes

A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be deformed. In this paper, we systematically study the rigidity of spherical codes, particularly kissing configurations. One surprise is that the kissing configuration of the Coxeter-Todd lattice is not jammed, despite being locally jammed (each individual cap is held in place if its neighbors are fixed); in this respect, the Coxeter-Todd lattice is analogous to the face-centered cubic lattice in three dimensions. By contrast, we find that many other packings have jammed kissing configurations, including the Barnes-Wall lattice and all of the best kissing configurations known in four through twelve dimensions. Jamming seems to become much less common for large kissing configurations in higher dimensions, and in particular it fails for the best kissing configurations known in 25 through 31 dimensions. Motivated by this phenomenon, we find new kissing configurations in these dimensions, which improve on the records set in 1982 by the laminated lattices.Comment: 39 pages, 8 figure