Spatial Aggregation: Theory and Applications

Visual thinking plays an important role in scientific reasoning. Based on the research in automating diverse reasoning tasks about dynamical systems, nonlinear controllers, kinematic mechanisms, and fluid motion, we have identified a style of visual thinking, imagistic reasoning. Imagistic reasoning organizes computations around image-like, analogue representations so that perceptual and symbolic operations can be brought to bear to infer structure and behavior. Programs incorporating imagistic reasoning have been shown to perform at an expert level in domains that defy current analytic or numerical methods. We have developed a computational paradigm, spatial aggregation, to unify the description of a class of imagistic problem solvers. A program written in this paradigm has the following properties. It takes a continuous field and optional objective functions as input, and produces high-level descriptions of structure, behavior, or control actions. It computes a multi-layer of intermediate representations, called spatial aggregates, by forming equivalence classes and adjacency relations. It employs a small set of generic operators such as aggregation, classification, and localization to perform bidirectional mapping between the information-rich field and successively more abstract spatial aggregates. It uses a data structure, the neighborhood graph, as a common interface to modularize computations. To illustrate our theory, we describe the computational structure of three implemented problem solvers -- KAM, MAPS, and HIPAIR --- in terms of the spatial aggregation generic operators by mixing and matching a library of commonly used routines.Comment: See http://www.jair.org/ for any accompanying file

Optimal topological simplification of discrete functions on surfaces

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance {\delta} from a given input function. The result is achieved by establishing a connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2{\delta}, constructively proving the tightness of a lower bound on the number of critical points given by the stability theorem of persistent homology in dimension two for any input function. We also show that an optimal solution can be computed in linear time after persistence pairs have been computed.Comment: 27 pages, 8 figure

Surface diffusion of graphs: Variational formulation, error analysis, and simulation

Surface diffusion is a (fourth-order highly nonlinear) geometric driven motion of a surface with normal velocity proportional to the surface Laplacian of mean curvature. We present a novel variational formulation for graphs and derive a priori error estimates for a time-continuous finite element discretization. We also introduce a semi-implicit time discretization and a Schur complement approach to solve the resulting fully discrete, linear systems. After computational verification of the orders of convergence for polynomial degrees 1 and 2, we show several simulations in one dimension and two dimensions with and without forcing which explore the smoothing effect of surface diffusion, as well as the onset of singularities in finite time, such as infinite slopes and cracks.Fil: Bänsch, Eberhard. Freie Universität Berlin; . Weierstrass Institute For Applied Analysis And Stochastics;Fil: Morin, Pedro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Matemática Aplicada del Litoral. Universidad Nacional del Litoral. Instituto de Matemática Aplicada del Litoral; ArgentinaFil: Nochetto, Ricardo Horacio. University of Maryland; Estados Unido

Discretization of the 3D Monge-Ampere operator, between Wide Stencils and Power Diagrams

We introduce a monotone (degenerate elliptic) discretization of the Monge-Ampere operator, on domains discretized on cartesian grids. The scheme is consistent provided the solution hessian condition number is uniformly bounded. Our approach enjoys the simplicity of the Wide Stencil method, but significantly improves its accuracy using ideas from discretizations of optimal transport based on power diagrams. We establish the global convergence of a damped Newton solver for the discrete system of equations. Numerical experiments, in three dimensions, illustrate the scheme efficiency

On Range Searching with Semialgebraic Sets II

Let $P$ be a set of $n$ points in $\R^d$. We present a linear-size data structure for answering range queries on $P$ with constant-complexity semialgebraic sets as ranges, in time close to $O(n^{1-1/d})$. It essentially matches the performance of similar structures for simplex range searching, and, for $d\ge 5$, significantly improves earlier solutions by the first two authors obtained in~1994. This almost settles a long-standing open problem in range searching. The data structure is based on the polynomial-partitioning technique of Guth and Katz [arXiv:1011.4105], which shows that for a parameter $r$, $1 < r \le n$, there exists a $d$-variate polynomial $f$ of degree $O(r^{1/d})$ such that each connected component of $\R^d\setminus Z(f)$ contains at most $n/r$ points of $P$, where $Z(f)$ is the zero set of $f$. We present an efficient randomized algorithm for computing such a polynomial partition, which is of independent interest and is likely to have additional applications

Exploring Periodic Orbit Expansions and Renormalisation with the Quantum Triangular Billiard

A study of the quantum triangular billiard requires consideration of a boundary value problem for the Green's function of the Laplacian on a trianglar domain. Our main result is a reformulation of this problem in terms of coupled non--singular integral equations. A non--singular formulation, via Fredholm's theory, guarantees uniqueness and provides a mathematically firm foundation for both numerical and analytic studies. We compare and contrast our reformulation, based on the exact solution for the wedge, with the standard singular integral equations using numerical discretisation techniques. We consider in detail the (integrable) equilateral triangle and the Pythagorean 3-4-5 triangle. Our non--singular formulation produces results which are well behaved mathematically. In contrast, while resolving the eigenvalues very well, the standard approach displays various behaviours demonstrating the need for some sort of ``renormalisation''. The non-singular formulation provides a mathematically firm basis for the generation and analysis of periodic orbit expansions. We discuss their convergence paying particular emphasis to the computational effort required in comparision with Einstein--Brillouin--Keller quantisation and the standard discretisation, which is analogous to the method of Bogomolny. We also discuss the generalisation of our technique to smooth, chaotic billiards.Comment: 50 pages LaTeX2e. Uses graphicx, amsmath, amsfonts, psfrag and subfigure. 17 figures. To appear Annals of Physics, southern sprin

Noise Kernel in Stochastic Gravity and Stress Energy Bi-Tensor of Quantum Fields in Curved Spacetimes

The noise kernel is the vacuum expectation value of the (operator-valued) stress-energy bi-tensor which describes the fluctuations of a quantum field in curved spacetimes. It plays the role in stochastic semiclassical gravity based on the Einstein-Langevin equation similar to the expectation value of the stress-energy tensor in semiclassical gravity based on the semiclassical Einstein equation. According to the stochastic gravity program, this two point function (and by extension the higher order correlations in a hierarchy) of the stress energy tensor possesses precious statistical mechanical information of quantum fields in curved spacetime and, by the self-consistency required of Einstein's equation, provides a probe into the coherence properties of the gravity sector (as measured by the higher order correlation functions of gravitons) and the quantum nature of spacetime. It reflects the low and medium energy (referring to Planck energy as high energy) behavior of any viable theory of quantum gravity, including string theory. It is also useful for calculating quantum fluctuations of fields in modern theories of structure formation and for backreaction problems in cosmological and black holes spacetimes. We discuss the properties of this bi-tensor with the method of point-separation, and derive a regularized expression of the noise-kernel for a scalar field in general curved spacetimes. One collorary of our finding is that for a massless conformal field the trace of the noise kernel identically vanishes. We outline how the general framework and results derived here can be used for the calculation of noise kernels for Robertson-Walker and Schwarzschild spacetimes.Comment: 22 Pages, RevTeX; version accepted for publication in PR