We consider an overdetermined elliptic problem known as the hollow vortex problem. We prove that the solutions to this problem are in 1:1 correspondence with minimal graphs bounded by horizontal symmetry lines. We use this correspondence to give various examples of domains with hollow vortices.
A family of periodic solutions to the hollow vortex problem was constructed by Baker, Saffman and Sheffield in @cite_6 . It corresponds to the family of horizontal Scherk surfaces (see Figure , top left) -- the authors were of course not aware of that relationship. The same solution was derived again by Crowdy and Green in @cite_3 , together with another family of solutions called "staggered vortex streets". The corresponding minimal graphs are periodic and take on two different values on the boundary as in Case II. However, they are asymptotic to half-planes of non-zero slope at infinity, so extending these surfaces by reflection yields complete minimal surfaces which are not embedded.
@cite_3 @cite_6
1966911335 2049968098 2010371781 1893146140 2161278885 2151568819 2463117017 2023693336 2012048508 2023763411 2118972993 2002700608 2962921156 1889062234 2129152507 2116325468 2106143926 1992225844 2259676875 1861554096
New analytical solutions are presented for steadily translating von Karman vortex streets made up of two infinite rows of hollow vortices. First, the solution for a single row of hollow vortices due to ["Structure of a linear array of hollow vortices of finite cross-section," J. Fluid Mech. 74, 469 (1976)] is rederived, in a modified form, and using a new mathematical approach. This approach is then generalized to find relative equilibria for both unstaggered and staggered double hollow vortex streets. The method employs a combination of free streamline theory and conformal mapping ideas. The staggered hollow vortex streets are compared with analogous numerical solutions for double streets of vortex patches due to Saffman and Schatzman [“Properties of a vortex street of finite vortices,” SIAM (Soc. Ind. Appl. Math.) J. Sci. Stat. Comput. 2, 285 (1981)] and several common features are found. In particular, within the two different inviscid vortex models, the same street aspect ratio of approxi... Free-streamline theory is employed to construct an exact steady solution for a linear array of hollow, or stagnant cored, vortices in an inviscid incompressible fluid. If each vortex has area A and the separation is L, there are two possible shapes if A[1 2] L is less than a critical value 0.38 and none if it is larger. The stability of the shapes to two-dimensional, periodic and symmetric disturbances is considered for hollow vortices. The more deformed of the two possible shapes is found to be unstable while the less deformed shape is stable. We show that the stochastic differential equation (SDE) model for the merger of two identical two-dimensional vortices proposed by Agullo and Verga [“Exact two vortices solution of Navier–Stokes equation,” Phys. Rev. Lett. 78, 2361 (1997)] is a special case of a more general class of SDE models for N interacting vortex filaments. These toy models include vorticity diffusion via a white noise forcing of the inviscid equations, and thus extend inviscid models to include core dynamics and topology change (e.g., merger in two dimensions and vortex reconnection in three dimensions). We demonstrate that although the N=2 two-dimensional model is qualitatively and quantitatively incorrect, it can be dramatically improved by accounting for self-advection. We then extend the two-dimensional SDE model to three dimensions using the semi-inviscid asymptotic approximation of [“Simplified equations for the interactions of nearly parallel vortex filaments,” J. Fluid Mech. 288, 201 (1995)] for nearly parallel... This is the second in a series of papers in which we derive a @math -expansion for the two-dimensional non-local Ginzburg-Landau energy with Coulomb repulsion known as the Ohta-Kawasaki model in connection with diblock copolymer systems. In this model, two phases appear, which interact via a nonlocal Coulomb type energy. Here we focus on the sharp interface version of this energy in the regime where one of the phases has very small volume fraction, thus creating small "droplets" of the minority phase in a "sea" of the majority phase. In our previous paper, we computed the @math -limit of the leading order energy, which yields the averaged behavior for almost minimizers, namely that the density of droplets should be uniform. Here we go to the next order and derive a next order @math -limit energy, which is exactly the Coulombian renormalized energy obtained by Sandier and Serfaty as a limiting interaction energy for vortices in the magnetic Ginzburg-Landau model. The derivation is based on the abstract scheme of Sandier-Serfaty that serves to obtain lower bounds for 2-scale energies and express them through some probabilities on patterns via the multiparameter ergodic theorem. Without thus appealing to the Euler-Lagrange equation, we establish for all configurations which have "almost minimal energy" the asymptotic roundness and radius of the droplets, and the fact that they asymptotically shrink to points whose arrangement minimizes the renormalized energy in some averaged sense. Via a kind of @math -equivalence, the obtained results also yield an expansion of the minimal energy for the original Ohta-Kawasaki energy. This leads to expecting to see triangular lattices of droplets as energy minimizers. This paper develops the separating capacities of families of nonlinear decision surfaces by a direct application of a theorem in classical combinatorial geometry. It is shown that a family of surfaces having d degrees of freedom has a natural separating capacity of 2d pattern vectors, thus extending and unifying results of Winder and others on the pattern-separating capacity of hyperplanes. Applying these ideas to the vertices of a binary n-cube yields bounds on the number of spherically, quadratically, and, in general, nonlinearly separable Boolean functions of n variables. It is shown that the set of all surfaces which separate a dichotomy of an infinite, random, separable set of pattern vectors can be characterized, on the average, by a subset of only 2d extreme pattern vectors. In addition, the problem of generalizing the classifications on a labeled set of pattern points to the classification of a new point is defined, and it is found that the probability of ambiguous generalization is large unless the number of training patterns exceeds the capacity of the set of separating surfaces. We investigate the behavior of quasi-Newton algorithms applied to minimize a nonsmooth function f, not necessarily convex. We introduce an inexact line search that generates a sequence of nested intervals containing a set of points of nonzero measure that satisfy the Armijo and Wolfe conditions if f is absolutely continuous along the line. Furthermore, the line search is guaranteed to terminate if f is semi-algebraic. It seems quite difficult to establish a convergence theorem for quasi-Newton methods applied to such general classes of functions, so we give a careful analysis of a special but illuminating case, the Euclidean norm, in one variable using the inexact line search and in two variables assuming that the line search is exact. In practice, we find that when f is locally Lipschitz and semi-algebraic with bounded sublevel sets, the BFGS (Broyden–Fletcher–Goldfarb–Shanno) method with the inexact line search almost always generates sequences whose cluster points are Clarke stationary and with function values converging R-linearly to a Clarke stationary value. We give references documenting the successful use of BFGS in a variety of nonsmooth applications, particularly the design of low-order controllers for linear dynamical systems. We conclude with a challenging open question. Approximations of solutions of fractional Laplacian equations on bounded domains are considered. Such equations allow global interactions between points separated by arbitrarily large distances. Two approximations are introduced. First, interactions are localized so that only points less than some specified distance, referred to as the interaction radius, are allowed to interact. The resulting truncated problem is a special case of a more general nonlocal diffusion problem. The second approximation is the spatial discretization of the related nonlocal diffusion problem. A recently developed abstract framework for asymptotically compatible schemes is applied to prove convergence results for solutions of the truncated and discretized problem to the solutions of the fractional Laplacian problems. Intermediate results also provide new convergence results for the nonlocal diffusion problem. Special attention is paid to limiting behaviors as the interaction radius increases and the spatial grid size decreases, regardless of how these parameters may or may not be dependent. In particular, we show that conforming Galerkin finite element approximations of the nonlocal diffusion equation are always asymptotically compatible schemes for the corresponding fractional Laplacian model as the interaction radius increases and the grid size decreases. The results are developed with minimal regularity assumptions on the solution and are applicable to general domains and general geometric meshes with no restriction on the space dimension and with data that are only required to be square integrable. Furthermore, our results also solve an open conjecture given in the literature about the convergence of numerical solutions on a fixed mesh as the interaction radius increases. We study pseudoholomorphic curves in symplectic quotients as adiabatic limits of solutions to the symplectic vortex equations. Our main theorem asserts that the genus zero invariants of Hamiltonian group actions defined by these equations are related to the genus zero Gromov–Witten invariants of the symplectic quotient (in the monotone case) via a natural ring homomorphism from the equivariant cohomology of the ambient space to the quantum cohomology of the quotient. In this paper, we cast the problem of point cloud matching as a shape matching problem by transforming each of the given point clouds into a shape representation called the Schrodinger distance transform (SDT) representation. This is achieved by solving a static Schrodinger equation instead of the corresponding static Hamilton-Jacobi equation in this setting. The SDT representation is an analytic expression and following the theoretical physics literature, can be normalized to have unit 2 norm -- making it a square-root density, which is identified with a point on a unit Hilbert sphere, whose intrinsic geometry is fully known. The Fisher-Rao metric, a natural metric for the space of densities leads to analytic expressions for the geodesic distance between points on this sphere. In this paper, we use the well known Riemannian framework never before used for point cloud matching, and present a novel matching algorithm. We pose point set matching under rigid and non-rigid transformations in this framework and solve for the transformations using standard nonlinear optimization techniques. Finally, to evaluate the performance of our algorithm -- dubbed SDTM -- we present several synthetic and real data examples along with extensive comparisons to state-of-the-art techniques. The experiments show that our algorithm outperforms state-of the-art point set registration algorithms on many quantitative metrics. Abstract We consider boundary value problems for semilinear hyperbolic systems of the type ∂ t u j + a j ( x , λ ) ∂ x u j + b j ( x , λ , u ) = 0 , x ∈ ( 0 , 1 ) , j = 1 , … , n , with smooth coefficient functions a j and b j such that b j ( x , λ , 0 ) = 0 for all x ∈ [ 0 , 1 ] , λ ∈ R , and j = 1 , … , n . We state conditions for Hopf bifurcation, i.e., for existence, local uniqueness (up to phase shifts), smoothness and smooth dependence on λ of time-periodic solutions bifurcating from the zero stationary solution. Furthermore, we derive a formula which determines the bifurcation direction. The proof is done by means of a Liapunov–Schmidt reduction procedure. For this purpose, Fredholm properties of the linearized system and implicit function theorem techniques are used. Abstract Since the seminal work of [Sussman, M, Smereka P, Osher S. A level set approach for computing solutions to incompressible two-phase flow. J Comput Phys 1994;114:146–59] on coupling the level set method of [Osher S, Sethian J. Fronts propagating with curvature-dependent speed: algorithms based on Hamilton–Jacobi formulations. J Comput Phys 1988;79:12–49] to the equations for two-phase incompressible flow, there has been a great deal of interest in this area. That work demonstrated the most powerful aspects of the level set method, i.e. automatic handling of topological changes such as merging and pinching, as well as robust geometric information such as normals and curvature. Interestingly, this work also demonstrated the largest weakness of the level set method, i.e. mass or information loss characteristic of most Eulerian capturing techniques. In fact, [Sussman M, Smereka P, Osher S. A level set approach for computing solutions to incompressible two-phase flow. J Comput Phys 1994;114:146–59] introduced a partial differential equation for battling this weakness, without which their work would not have been possible. In this paper, we discuss both historical and most recent works focused on improving the computational accuracy of the level set method focusing in part on applications related to incompressible flow due to both of its popularity and stringent accuracy requirements. Thus, we discuss higher order accurate numerical methods such as Hamilton–Jacobi WENO [Jiang G-S, Peng D. Weighted ENO schemes for Hamilton–Jacobi equations. SIAM J Sci Comput 2000;21:2126–43], methods for maintaining a signed distance function, hybrid methods such as the particle level set method [Enright D, Fedkiw R, Ferziger J, Mitchell I. A hybrid particle level set method for improved interface capturing. J Comput Phys 2002;183:83–116] and the coupled level set volume of fluid method [Sussman M, Puckett EG. A coupled level set and volume-of-fluid method for computing 3d and axisymmetric incompressible two-phase flows. J Comput Phys 2000;162:301–37], and adaptive gridding techniques such as the octree approach to free surface flows proposed in [Losasso F, Gibou F, Fedkiw R. Simulating water and smoke with an octree data structure, ACM Trans Graph (SIGGRAPH Proc) 2004;23:457–62]. We study the asymptotic statistical behavior of the 2-dimensional periodic Lorentz gas with an infinite horizon. We consider a particle moving freely in the plane with elastic reflections from a periodic set of fixed convex scatterers. We assume that the initial position of the particle in the phase space is random with uniform distribution with respect to the Liouville measure of the periodic problem. We are interested in the asymptotic statistical behavior of the particle displacement in the plane as the timet goes to infinity. We assume that the particle horizon is infinite, which means that the length of free motion of the particle is unbounded. Then we show that under some natural assumptions on the free motion vector autocorrelation function, the limit distribution of the particle displacement in the plane is Gaussian, but the normalization factor is (t logt)1 2 and nott1 2 as in the classical case. We find the covariance matrix of the limit distribution. In this article, we study small perturbations of the family of Friedmann–Lemaitre–Robertson–Walker cosmological background solutions to the 1 + 3 dimensional Euler–Einstein system with a positive cosmological constant. These background solutions describe an initially uniform quiet fluid of positive energy density evolving in a spacetime undergoing accelerated expansion. Our nonlinear analysis shows that under the equation of state ( p = c^2_s ) , ( 0 < c^2_s < 1 3 ) , the background solutions are globally future-stable. In particular, we prove that the perturbed spacetime solutions, which have the topological structure ( [0, ) T ^3 ) , are future-causally geodesically complete. These results are extensions of previous results derived by the author in a collaboration with I. Rodnianski, in which the fluid was assumed to be irrotational. Our novel analysis of a fluid with non-zero vorticity is based on the use of suitably defined energy currents. This thesis deals with the question of the minimal number of distinct periodic Reeb orbits on a contact manifold which is the boundary of a compact symplectic manifold.The positive S1-equivariant symplectic homology is one of the main tools considered in this thesis. It is built from periodic orbits of Hamiltonian vector fields in a symplectic manifold whose boundary is the given contact manifold.Our first result describes the relation between the symplectic homologies of an exact compact symplectic manifold with contact type boundary (also called Liouville domain), and the periodic Reeb orbits on the boundary. We then prove some properties of these homologies. For a Liouville domain embedded into another one, we construct a morphism between their homologies. We study the invariance of the homologies with respect to the choice of the contact form on the boundary.We use the positive S1-equivariant symplectic homology to give a new proof of a Theorem by Ekeland and Lasry about the minimal number of distinct periodic Reeb orbits on some hypersurfaces in R2n. We indicate how it extends to some hypersurfaces in some negative line bundles. We also give a characterisation and a new way to compute the generalized Conley-Zehnder index defined by Robbin and Salamon for any path of symplectic matrices. A tool for this is a new analysis of normal forms for symplectic matrices. Abstract This paper reports large-scale direct numerical simulations of homogeneous-isotropic fluid turbulence, achieving sustained performance of 1.08 petaflop s on gpu hardware using single precision. The simulations use a vortex particle method to solve the Navier–Stokes equations, with a highly parallel fast multipole method ( fmm ) as numerical engine, and match the current record in mesh size for this application, a cube of 4096 3 computational points solved with a spectral method. The standard numerical approach used in this field is the pseudo-spectral method, relying on the fft algorithm as the numerical engine. The particle-based simulations presented in this paper quantitatively match the kinetic energy spectrum obtained with a pseudo-spectral method, using a trusted code. In terms of parallel performance, weak scaling results show the fmm -based vortex method achieving 74 parallel efficiency on 4096 processes (one gpu per mpi process, 3 gpu s per node of the tsubame -2.0 system). The fft -based spectral method is able to achieve just 14 parallel efficiency on the same number of mpi processes (using only cpu cores), due to the all-to-all communication pattern of the fft algorithm. The calculation time for one time step was 108 s for the vortex method and 154 s for the spectral method, under these conditions. Computing with 69 billion particles, this work exceeds by an order of magnitude the largest vortex-method calculations to date. We investigate a problem posed by L. Hauswirth, F. H 'elein, and F. Pacard, namely, to characterize all the domains in the plane that admit a "roof function", i.e., a positive harmonic function which solves simultaneously a Dirichlet problem with null boundary data, and a Neumann problem with constant boundary data. Under some a priori assumptions, we show that the only three examples are the exterior of a disk, a halfplane, and a nontrivial example. We show that in four dimensions the nontrivial simply connected example does not have any axially symmetric analog containing its own axis of symmetry. Two random-walk related problems which have been studied independently in the past, the expected maximum of a random walker in one dimension and the flux to a spherical trap of particles undergoing discrete jumps in three dimensions, are shown to be closely related to each other and are studied using a unified approach as a solution to a Wiener-Hopf problem. For the flux problem, this work shows that a constant c = 0.29795219 which appeared in the context of the boundary extrapolation length, and was previously found only numerically, can be derived analytically. The same constant enters in higher-order corrections to the expected-maximum asymptotics. As a byproduct, we also prove a new universal result in the context of the flux problem which is an analogue of the Sparre Andersen theorem proved in the context of the random walker's maximum. This paper aims at building a variational approach to the dynamics of discrete topological singularities in two dimensions, based on Γ-convergence. We consider discrete systems, described by scalar functions defined on a square lattice and governed by periodic interaction potentials. Our main motivation comes from XY spin systems, described by the phase parameter, and screw dislocations, described by the displacement function. For these systems, we introduce a discrete notion of vorticity. As the lattice spacing tends to zero we derive the first order Γ-limit of the free energy which is referred to as renormalized energy and describes the interaction of vortices. As a byproduct of this analysis, we show that such systems exhibit increasingly many metastable configurations of singularities. Therefore, we propose a variational approach to the depinning and dynamics of discrete vortices, based on minimizing movements. We show that, letting first the lattice spacing and then the time step of the minimizing movements tend to zero, the vortices move according with the gradient flow of the renormalized energy, as in the continuous Ginzburg–Landau framework. A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, ( )-decomposition refers to a probability distribution over partitions of the metric into sets of low diameter, such that nearby points (parameterized by ( >0 )) are likely to be “clustered” together. Applying this notion to the shortest-path metric in edge-weighted graphs, it is known that n-vertex graphs admit an (O( n) )-padded decomposition (Bartal, 37th annual symposium on foundations of computer science. IEEE, pp 184–193, 1996), and that excluded-minor graphs admit O(1)-padded decomposition (, 25th annual ACM symposium on theory of computing, pp 682–690, 1993; Fakcharoenphol and Talwar, J Comput Syst Sci 69(3), 485–497, 2004; , Proceedings of the 46th annual ACM symposium on theory of computing. STOC ’14, pp 79–88. ACM, New York, NY, USA, 2014). We design decompositions to the family of p-path-separable graphs, which was defined by Abraham and Gavoille (Proceedings of the twenty-fifth annual acm symposium on principles of distributed computing, PODC ’06, pp 188–197, 2006) and refers to graphs that admit vertex-separators consisting of at most p shortest paths in the graph. Our main result is that every p-path-separable n-vertex graph admits an (O( (p n)) )-decomposition, which refines the (O( n) ) bound for general graphs, and provides new bounds for families like bounded-treewidth graphs. Technically, our clustering process differs from previous ones by working in (the shortest-path metric of) carefully chosen subgraphs. We show the analytic continuation of the resolvent of the Laplacian on asymptotically hyperbolic spaces on differential forms, including high energy estimates in strips. This is achieved by placing the spectral family of the Laplacian within the framework developed, and applied to scalar problems, by the author recently, roughly by extending the problem across the boundary of the compactification of the asymptotically hyperbolic space in a suitable manner. The main novelty is that the non-scalar nature of the operator is dealt with by relating it to a problem on an asymptotically Minkowski space to motivate the choice of the extension across the conformal boundary.