Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials

International Journal of Computer Mathematics (Impact Factor: 0.82). 01/2011; 88(1):183-195. DOI: 10.1080/00207160903365891
Source: DBLP


This paper studies the eigenvalue optimization problems in the shape design of the two-density inhomogeneous materials. Two types of greedy algorithms are proposed to solve three optimization problems in finite element discretization. In the first type, the whole domain is initialized by one density. For each problem of the eigenvalue optimizations, we define a measurement of the element, which is the criterion to determine the ‘best’ element. We change the density of the ‘best’ element to the other density. Then the algorithm repeats the procedure until the area constraint is satisfied. In the second type, the algorithm begins with the density distribution satisfying the area constraint. Also, according to the measurement of the element, the algorithm finds a pair of the ‘best’ elements and exchanges their densities between each other. Furthermore, the accelerating greedy algorithms are proposed to speed up both two types. Three numerical examples are provided to illustrate the results.

10 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates optimization of the least eigenvalue of −Δ with the constraint of one-dimension Hausdorff measure of Dirichlet boundary. We propose the boundary piecewise constant level set (BPCLS) method based on the regularity technique to combine two types of boundary conditions into a single Robin boundary condition. We derive the first variation of the least eigenvalue w.r.t. the BPCLS function and propose a penalty BPCLS algorithm and an augmented Lagrangian BPCLS algorithm. Numerical results are reported for experiments on ellipse and L-shape domains.
    No preview · Article · Jan 2011 · Journal of Computational Physics
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates the eigenmode optimization problem governed by the scalarHelmholtz equation in continuumsysteminwhich the computed eigenmode approaches the prescribed eigenmode in the whole domain. The first variation for the eigenmode optimization problem is evaluated by the quadratic penalty method, the adjoint variable method, and the formula based on sensitivity analysis. A penalty optimization algorithm is proposed, in which the density evolution is accomplished by introducing an artificial time term and solving an additional ordinary differential equation. The validity of the presented algorithm is confirmed by numerical results of the first and second eigenmode optimizations in 1D and 2D problems.
    No preview · Article · Jan 2013 · Communications in Computational Physics
  • [Show abstract] [Hide abstract]
    ABSTRACT: Designing an acoustic drum can be categorized into a class of eigenvalue optimization problems in the structural engineering area. In this paper, we propose an algorithm that is based on the Gâteaux derivative of the objective function with respect to the density functions and analyze our algorithm in detail. In the algorithm, we deal with the geometry constraint by exchanging the densities of two domains occupied by two kinds of different materials. Finally we apply this algorithm to some practical examples frequently used by the researchers and present some numerical results to show its feasibility, stability and efficiency.
    No preview · Article · Aug 2013 · Computers & Mathematics with Applications
Show more