5,983 research outputs found
Error estimation and adjoint-based adaptation in aerodynamics
In this article we give an overview of recent developments
in error estimation and in residual-based and goal-oriented
(adjoint-based) adaptation for Discontinuous Galerkin discretizations
of sub- and supersonic viscous compressible flows. We also give an
outlook on the planned continuation of this research in the EU project
ADIGMA
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
Recursive Program Optimization Through Inductive Synthesis Proof Transformation
The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality
A Category Theoretical Argument Against the Possibility of Artificial Life
One of Robert Rosen's main contributions to the scientific community is summarized in his book 'Life itself'. There Rosen presents a theoretical framework to define living systems; given this definition, he goes on to show that living systems are not realisable in computational universes. Despite being well known and often cited, Rosen's central proof has so far not been evaluated by the scientific community. In this article we review the essence of Rosen's ideas leading up to his rejection of the possibility of real artificial life in silico. We also evaluate his arguments and point out that some of Rosen's central notions are ill- defined. The conclusion of this article is that Rosen's central proof is wrong
Antiprismless, or: Reducing Combinatorial Equivalence to Projective Equivalence in Realizability Problems for Polytopes
This article exhibits a 4-dimensional combinatorial polytope that has no
antiprism, answering a question posed by Bernt Lindst\"om. As a consequence,
any realization of this combinatorial polytope has a face that it cannot rest
upon without toppling over. To this end, we provide a general method for
solving a broad class of realizability problems. Specifically, we show that for
any semialgebraic property that faces inherit, the given property holds for
some realization of every combinatorial polytope if and only if the property
holds from some projective copy of every polytope. The proof uses the following
result by Below. Given any polytope with vertices having algebraic coordinates,
there is a combinatorial "stamp" polytope with a specified face that is
projectively equivalent to the given polytope in all realizations. Here we
construct a new stamp polytope that is closely related to Richter-Gebert's
proof of universality for 4-dimensional polytopes, and we generalize several
tools from that proof
- ā¦