45,094 research outputs found
Translating a Regular Grid over a Point Set
We consider the problem of translating a (finite or infinite) square grid
G over a set S of n points in the plane in order to maximize some objective
function. We say that a grid cell is k-occupied if it contains k or more
points of 5. The main set of problems we study have to do with translating
an infinite grid so that the number of fe-occupied cells is maximized
or minimized. For these problems we obtain running times of the form
O(kn polylog n). We also consider the problem of translating a finite size
grid, with m cells, in order to maximize the number of fe-occupied cells.
Here we obtain a running time of the form O(knm polylog nm)
Unextendible mutually unbiased bases (after Mandayam, Bandyopadhyay, Grassl and Wootters)
We consider questions posed in a recent paper of Mandayam et al. (2014) on the nature of unextendible mutually unbiased bases. We describe a conceptual framework to study these questions, using a connection proved by the author in Thas (2009) between the set of nonidentity generalized Pauli operators on the Hilbert space of N d-level quantum systems, d a prime, and the geometry of non-degenerate alternating bilinear forms of rank N over finite fields F d
We then supply alternative and short proofs of results obtained in Mandayam et al. (2014), as well as new general bounds for the problems considered in loc. cit. In this setting, we also solve Conjecture 1 of Mandayam et al. (2014) and speculate on variations of this conjecture
A moving control volume approach to computing hydrodynamic forces and torques on immersed bodies
We present a moving control volume (CV) approach to computing hydrodynamic
forces and torques on complex geometries. The method requires surface and
volumetric integrals over a simple and regular Cartesian box that moves with an
arbitrary velocity to enclose the body at all times. The moving box is aligned
with Cartesian grid faces, which makes the integral evaluation straightforward
in an immersed boundary (IB) framework. Discontinuous and noisy derivatives of
velocity and pressure at the fluid-structure interface are avoided and
far-field (smooth) velocity and pressure information is used. We re-visit the
approach to compute hydrodynamic forces and torques through force/torque
balance equation in a Lagrangian frame that some of us took in a prior work
(Bhalla et al., J Comp Phys, 2013). We prove the equivalence of the two
approaches for IB methods, thanks to the use of Peskin's delta functions. Both
approaches are able to suppress spurious force oscillations and are in
excellent agreement, as expected theoretically. Test cases ranging from Stokes
to high Reynolds number regimes are considered. We discuss regridding issues
for the moving CV method in an adaptive mesh refinement (AMR) context. The
proposed moving CV method is not limited to a specific IB method and can also
be used, for example, with embedded boundary methods
Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model
Computer simulators can be computationally intensive to run over a large
number of input values, as required for optimization and various uncertainty
quantification tasks. The standard paradigm for the design and analysis of
computer experiments is to employ Gaussian random fields to model computer
simulators. Gaussian process models are trained on input-output data obtained
from simulation runs at various input values. Following this approach, we
propose a sequential design algorithm, MICE (Mutual Information for Computer
Experiments), that adaptively selects the input values at which to run the
computer simulator, in order to maximize the expected information gain (mutual
information) over the input space. The superior computational efficiency of the
MICE algorithm compared to other algorithms is demonstrated by test functions,
and a tsunami simulator with overall gains of up to 20% in that case
- …