Material Optimization for Nonlinearly Elastic Planar Beams

We consider the problem of an optimal distribution of soft and hard material for nonlinearly elastic planar beams. We prove that under gravitational force the optimal distribution involves no microstructure and is ordered, and we provide numerical simulations confirming and extending this observation.

Similar Publications

We propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen-Lo\`{e}ve (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Read More

In this work, we propose a parallel-in-time solver for linear and nonlinear ordinary differential equations. The approach is based on an efficient multilevel solver of the Schur complement related to a multilevel time partition. For linear problems, the scheme leads to a fast direct method. Read More

We consider a quasilinear degenerate diffusion-reaction system that describes biofilm formation. The model exhibits two non-linear effects: a power law degeneracy as one of the dependent variables vanishes and a super diffusion singularity as it approaches unity. Biologically relevant solutions are characterized by a moving interface and gradient blow-up there. Read More

While reduced-order models (ROMs) have been popular for efficiently solving large systems of differential equations, the stability of reduced models over long-time integration is of present challenges. We present a greedy approach for ROM generation of parametric Hamiltonian systems that captures the symplectic structure of Hamiltonian systems to ensure stability of the reduced model. Through the greedy selection of basis vectors, two new vectors are added at each iteration to the linear vector space to increase the accuracy of the reduced basis. Read More

A new numerical method is proposed for a 1-D inverse medium scattering problem with multi-frequency data. This method is based on the construction of a weighted cost functional. The weight is a Carleman Weight Function (CWF). Read More

We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense. Read More

In this paper we present two strategies to enable "parallelization across the method" for spectral deferred corrections (SDC). Using standard low-order time-stepping methods in an iterative fashion, SDC can be seen as preconditioned Picard iteration for the collocation problem. Typically, a serial Gauss-Seidel-like preconditioner is used, computing updates for each collocation node one by one. Read More

This work reformulates the complete electrode model of electrical impedance tomography in order to enable its more efficient numerical solution. The model traditionally assumes constant contact conductances on all electrodes, which leads to a discontinuous Robin boundary condition since the gaps between the electrodes can be described by vanishing conductance. As a consequence, the regularity of the electromagnetic potential is limited to less than two square-integrable weak derivatives, which negatively affects the convergence of, e. Read More

In this paper we demonstrate that the framework of nonlinear spectral decompositions based on total variation (TV) regularization is very well suited for image fusion as well as more general image manipulation tasks. The well-localized and edge-preserving spectral TV decomposition allows to select frequencies of a certain image to transfer particular features, such as wrinkles in a face, from one image to another. We illustrate the effectiveness of the proposed approach in several numerical experiments, including a comparison to the competing techniques of Poisson image editing, linear osmosis, wavelet fusion and Laplacian pyramid fusion. Read More

Local adaptivity and mesh refinement are key to the efficient simulation of wave phenomena in heterogeneous media or complex geometry. Locally refined meshes, however, dictate a small time-step everywhere with a crippling effect on any explicit time-marching method. In [18] a leap-frog (LF) based explicit local time-stepping (LTS) method was proposed, which overcomes the severe bottleneck due to a few small elements by taking small time-steps in the locally refined region and larger steps elsewhere. Read More