A new doubly discrete analogue of smoke ring flow and the real time simulation of fluid flow

Modelling incompressible ideal fluids as a finite collection of vortex filaments is important in physics (super-fluidity, models for the onset of turbulence) as well as for numerical algorithms used in computer graphics for the real time simulation of smoke. Here we introduce a time-discrete evolution equation for arbitrary closed polygons in 3-space that is a discretisation of the localised induction approximation of filament motion. This discretisation shares with its continuum limit the property that it is a completely integrable system. We apply this polygon evolution to a significant improvement of the numerical algorithms used in Computer Graphics.Comment: 15 pages, 3 figure

Automated thematic mapping and change detection of ERTS-A images

The author has identified the following significant results. For the recognition of terrain types, spatial signatures are developed from the diffraction patterns of small areas of ERTS-1 images. This knowledge is exploited for the measurements of a small number of meaningful spatial features from the digital Fourier transforms of ERTS-1 image cells containing 32 x 32 picture elements. Using these spatial features and a heuristic algorithm, the terrain types in the vicinity of Phoenix, Arizona were recognized by the computer with a high accuracy. Then, the spatial features were combined with spectral features and using the maximum likelihood criterion the recognition accuracy of terrain types increased substantially. It was determined that the recognition accuracy with the maximum likelihood criterion depends on the statistics of the feature vectors. Nonlinear transformations of the feature vectors are required so that the terrain class statistics become approximately Gaussian. It was also determined that for a given geographic area the statistics of the classes remain invariable for a period of a month but vary substantially between seasons

Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K

We consider systems A_\ell(t) y(q^\ell t) + ... + A_0(t) y(t) = b(t) of higher order q-recurrence equations with rational coefficients. We extend a method for finding a bound on the maximal power of t in the denominator of arbitrary rational solutions y(t) as well as a method for bounding the degree of polynomial solutions from the scalar case to the systems case. The approach is direct and does not rely on uncoupling or reduction to a first order system. Unlike in the scalar case this usually requires an initial transformation of the system.Comment: 8 page

Study of multi black hole and ring singularity apparent horizons

We study critical black hole separations for the formation of a common apparent horizon in systems of $N$ - black holes in a time symmetric configuration. We study in detail the aligned equal mass cases for $N=2,3,4,5$, and relate them to the unequal mass binary black hole case. We then study the apparent horizon of the time symmetric initial geometry of a ring singularity of different radii. The apparent horizon is used as indicative of the location of the event horizon in an effort to predict a critical ring radius that would generate an event horizon of toroidal topology. We found that a good estimate for this ring critical radius is $20/(3\pi) M$. We briefly discuss the connection of this two cases through a discrete black hole 'necklace' configuration.Comment: 31 pages, 21 figure

Astrometric calibration and performance of the Dark Energy Camera

We characterize the ability of the Dark Energy Camera (DECam) to perform relative astrometry across its 500~Mpix, 3 deg^2 science field of view, and across 4 years of operation. This is done using internal comparisons of ~4x10^7 measurements of high-S/N stellar images obtained in repeat visits to fields of moderate stellar density, with the telescope dithered to move the sources around the array. An empirical astrometric model includes terms for: optical distortions; stray electric fields in the CCD detectors; chromatic terms in the instrumental and atmospheric optics; shifts in CCD relative positions of up to ~10 um when the DECam temperature cycles; and low-order distortions to each exposure from changes in atmospheric refraction and telescope alignment. Errors in this astrometric model are dominated by stochastic variations with typical amplitudes of 10-30 mas (in a 30 s exposure) and 5-10 arcmin coherence length, plausibly attributed to Kolmogorov-spectrum atmospheric turbulence. The size of these atmospheric distortions is not closely related to the seeing. Given an astrometric reference catalog at density ~0.7 arcmin^{-2}, e.g. from Gaia, the typical atmospheric distortions can be interpolated to 7 mas RMS accuracy (for 30 s exposures) with 1 arcmin coherence length for residual errors. Remaining detectable error contributors are 2-4 mas RMS from unmodelled stray electric fields in the devices, and another 2-4 mas RMS from focal plane shifts between camera thermal cycles. Thus the astrometric solution for a single DECam exposure is accurate to 3-6 mas (0.02 pixels, or 300 nm) on the focal plane, plus the stochastic atmospheric distortion.Comment: Submitted to PAS

Fast Computation of Smith Forms of Sparse Matrices Over Local Rings

We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of tools, such as matrix rank computation over finite fields, for which the best-known time- and memory-efficient algorithms are probabilistic. For an \nxn matrix $A$ over the ring \Fzfe, where $f^e$ is a power of an irreducible polynomial f \in \Fz of degree $d$, our algorithm requires \bigO(\eta de^2n) operations in \F, where our black-box is assumed to require \bigO(\eta) operations in \F to compute a matrix-vector product by a vector over \Fzfe (and $\eta$ is assumed greater than \Pden). The algorithm only requires additional storage for \bigO(\Pden) elements of \F. In particular, if \eta=\softO(\Pden), then our algorithm requires only \softO(n^2d^2e^3) operations in \F, which is an improvement on known dense methods for small $d$ and $e$. For the ring \ZZ/p^e\ZZ, where $p$ is a prime, we give an algorithm which is time- and memory-efficient when the number of nontrivial invariant factors is small. We describe a method for dimension reduction while preserving the invariant factors. The time complexity is essentially linear in $\mu n r e \log p,$ where $\mu$ is the number of operations in \ZZ/p\ZZ to evaluate the black-box (assumed greater than $n$) and $r$ is the total number of non-zero invariant factors. To avoid the practical cost of conditioning, we give a Monte Carlo certificate, which at low cost, provides either a high probability of success or a proof of failure. The quest for a time- and memory-efficient solution without restrictions on the number of nontrivial invariant factors remains open. We offer a conjecture which may contribute toward that end.Comment: Preliminary version to appear at ISSAC 201