10,094 research outputs found
A posteriori modeling error estimates in the optimization of two-scale elastic composite materials
The a posteriori analysis of the discretization error and the modeling error
is studied for a compliance cost functional in the context of the optimization
of composite elastic materials and a two-scale linearized elasticity model. A
mechanically simple, parametrized microscopic supporting structure is chosen
and the parameters describing the structure are determined minimizing the
compliance objective. An a posteriori error estimate is derived which includes
the modeling error caused by the replacement of a nested laminate
microstructure by this considerably simpler microstructure. Indeed, nested
laminates are known to realize the minimal compliance and provide a benchmark
for the quality of the microstructures. To estimate the local difference in the
compliance functional the dual weighted residual approach is used. Different
numerical experiments show that the resulting adaptive scheme leads to simple
parametrized microscopic supporting structures that can compete with the
optimal nested laminate construction. The derived a posteriori error indicators
allow to verify that the suggested simplified microstructures achieve the
optimal value of the compliance up to a few percent. Furthermore, it is shown
how discretization error and modeling error can be balanced by choosing an
optimal level of grid refinement. Our two scale results with a single scale
microstructure can provide guidance towards the design of a producible
macroscopic fine scale pattern
Anisotropic Mesh Adaptation for Image Representation
Triangular meshes have gained much interest in image representation and have
been widely used in image processing. This paper introduces a framework of
anisotropic mesh adaptation (AMA) methods to image representation and proposes
a GPRAMA method that is based on AMA and greedy-point removal (GPR) scheme.
Different than many other methods that triangulate sample points to form the
mesh, the AMA methods start directly with a triangular mesh and then adapt the
mesh based on a user-defined metric tensor to represent the image. The AMA
methods have clear mathematical framework and provides flexibility for both
image representation and image reconstruction. A mesh patching technique is
developed for the implementation of the GPRAMA method, which leads to an
improved version of the popular GPRFS-ED method. The GPRAMA method can achieve
better quality than the GPRFS-ED method but with lower computational cost.Comment: 25 pages, 15 figure
A robust adaptive algebraic multigrid linear solver for structural mechanics
The numerical simulation of structural mechanics applications via finite
elements usually requires the solution of large-size and ill-conditioned linear
systems, especially when accurate results are sought for derived variables
interpolated with lower order functions, like stress or deformation fields.
Such task represents the most time-consuming kernel in commercial simulators;
thus, it is of significant interest the development of robust and efficient
linear solvers for such applications. In this context, direct solvers, which
are based on LU factorization techniques, are often used due to their
robustness and easy setup; however, they can reach only superlinear complexity,
in the best case, thus, have limited applicability depending on the problem
size. On the other hand, iterative solvers based on algebraic multigrid (AMG)
preconditioners can reach up to linear complexity for sufficiently regular
problems but do not always converge and require more knowledge from the user
for an efficient setup. In this work, we present an adaptive AMG method
specifically designed to improve its usability and efficiency in the solution
of structural problems. We show numerical results for several practical
applications with millions of unknowns and compare our method with two
state-of-the-art linear solvers proving its efficiency and robustness.Comment: 50 pages, 16 figures, submitted to CMAM
POD model order reduction with space-adapted snapshots for incompressible flows
We consider model order reduction based on proper orthogonal decomposition
(POD) for unsteady incompressible Navier-Stokes problems, assuming that the
snapshots are given by spatially adapted finite element solutions. We propose
two approaches of deriving stable POD-Galerkin reduced-order models for this
context. In the first approach, the pressure term and the continuity equation
are eliminated by imposing a weak incompressibility constraint with respect to
a pressure reference space. In the second approach, we derive an inf-sup stable
velocity-pressure reduced-order model by enriching the velocity reduced space
with supremizers computed on a velocity reference space. For problems with
inhomogeneous Dirichlet conditions, we show how suitable lifting functions can
be obtained from standard adaptive finite element computations. We provide a
numerical comparison of the considered methods for a regularized lid-driven
cavity problem
Progressive construction of a parametric reduced-order model for PDE-constrained optimization
An adaptive approach to using reduced-order models as surrogates in
PDE-constrained optimization is introduced that breaks the traditional
offline-online framework of model order reduction. A sequence of optimization
problems constrained by a given Reduced-Order Model (ROM) is defined with the
goal of converging to the solution of a given PDE-constrained optimization
problem. For each reduced optimization problem, the constraining ROM is trained
from sampling the High-Dimensional Model (HDM) at the solution of some of the
previous problems in the sequence. The reduced optimization problems are
equipped with a nonlinear trust-region based on a residual error indicator to
keep the optimization trajectory in a region of the parameter space where the
ROM is accurate. A technique for incorporating sensitivities into a
Reduced-Order Basis (ROB) is also presented, along with a methodology for
computing sensitivities of the reduced-order model that minimizes the distance
to the corresponding HDM sensitivity, in a suitable norm. The proposed reduced
optimization framework is applied to subsonic aerodynamic shape optimization
and shown to reduce the number of queries to the HDM by a factor of 4-5,
compared to the optimization problem solved using only the HDM, with errors in
the optimal solution far less than 0.1%
- …