92,079 research outputs found
A Time-Space Tradeoff for Triangulations of Points in the Plane
In this paper, we consider time-space trade-offs for reporting a triangulation of points in the plane. The goal is to minimize the amount of working space while keeping the total running time small. We present the first multi-pass algorithm on the problem that returns the edges of a triangulation with their adjacency information. This even improves the previously best known random-access algorithm
On barrier and modified barrier multigrid methods for 3d topology optimization
One of the challenges encountered in optimization of mechanical structures,
in particular in what is known as topology optimization, is the size of the
problems, which can easily involve millions of variables. A basic example is
the minimum compliance formulation of the variable thickness sheet (VTS)
problem, which is equivalent to a convex problem. We propose to solve the VTS
problem by the Penalty-Barrier Multiplier (PBM) method, introduced by R.\
Polyak and later studied by Ben-Tal and Zibulevsky and others. The most
computationally expensive part of the algorithm is the solution of linear
systems arising from the Newton method used to minimize a generalized augmented
Lagrangian. We use a special structure of the Hessian of this Lagrangian to
reduce the size of the linear system and to convert it to a form suitable for a
standard multigrid method. This converted system is solved approximately by a
multigrid preconditioned MINRES method. The proposed PBM algorithm is compared
with the optimality criteria (OC) method and an interior point (IP) method,
both using a similar iterative solver setup. We apply all three methods to
different loading scenarios. In our experiments, the PBM method clearly
outperforms the other methods in terms of computation time required to achieve
a certain degree of accuracy
Path integrals and symmetry breaking for optimal control theory
This paper considers linear-quadratic control of a non-linear dynamical
system subject to arbitrary cost. I show that for this class of stochastic
control problems the non-linear Hamilton-Jacobi-Bellman equation can be
transformed into a linear equation. The transformation is similar to the
transformation used to relate the classical Hamilton-Jacobi equation to the
Schr\"odinger equation. As a result of the linearity, the usual backward
computation can be replaced by a forward diffusion process, that can be
computed by stochastic integration or by the evaluation of a path integral. It
is shown, how in the deterministic limit the PMP formalism is recovered. The
significance of the path integral approach is that it forms the basis for a
number of efficient computational methods, such as MC sampling, the Laplace
approximation and the variational approximation. We show the effectiveness of
the first two methods in number of examples. Examples are given that show the
qualitative difference between stochastic and deterministic control and the
occurrence of symmetry breaking as a function of the noise.Comment: 21 pages, 6 figures, submitted to JSTA
Relating phase field and sharp interface approaches to structural topology optimization
A phase field approach for structural topology optimization which allows for topology
changes and multiple materials is analyzed. First order optimality conditions are
rigorously derived and it is shown via formally matched asymptotic
expansions that these conditions converge to classical first order conditions obtained in
the context of shape calculus. We also discuss how to deal with triple junctions where
e.g. two materials and the void meet. Finally, we present several
numerical results for mean compliance problems and a cost involving the least square error
to a target displacement
Multicore-optimized wavefront diamond blocking for optimizing stencil updates
The importance of stencil-based algorithms in computational science has
focused attention on optimized parallel implementations for multilevel
cache-based processors. Temporal blocking schemes leverage the large bandwidth
and low latency of caches to accelerate stencil updates and approach
theoretical peak performance. A key ingredient is the reduction of data traffic
across slow data paths, especially the main memory interface. In this work we
combine the ideas of multi-core wavefront temporal blocking and diamond tiling
to arrive at stencil update schemes that show large reductions in memory
pressure compared to existing approaches. The resulting schemes show
performance advantages in bandwidth-starved situations, which are exacerbated
by the high bytes per lattice update case of variable coefficients. Our thread
groups concept provides a controllable trade-off between concurrency and memory
usage, shifting the pressure between the memory interface and the CPU. We
present performance results on a contemporary Intel processor
Particle swarm optimization with sequential niche technique for dynamic finite element model updating
Peer reviewedPostprin
- …