Ke-wei Liang

Zhejiang University, Hang-hsien, Zhejiang Sheng, China

Are you Ke-wei Liang?

Claim your profile

Publications (2)2.77 Total impact

  • Zheng-Fang Zhang · Ke-Wei Liang · Xiao-Liang Cheng
    [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    No preview · Article · Jan 2011 · International Journal of Computer Mathematics
  • Zheng-fang Zhang · Ke-wei Liang · Xiao-liang Cheng
    [Show abstract] [Hide abstract]
    ABSTRACT: Many problems in engineering shape design involve eigenvalue optimizations. The relevant difficulty is that the eigenvalues are not continuously differentiable with respect to the density. In this paper, we are interested in the case of multi-density inhomogeneous materials which minimizes the least eigenvalue. With the finite element discretization, we propose a monotonically decreasing algorithm to solve the minimization problem. Some numerical examples are provided to illustrate the efficiency of the present algorithm as well as to demonstrate its availability for the case of more than two densities. As the computations are sensitive to the choice of the discretization mesh sizes, we adopt the refined mesh strategy, whose mesh grids are 25-times of the amount used in [S. Osher and F. Santosa, J. Comput. Phys., 171 (2001), pp. 272-288]. We also show the significant reduction in computational cost with the fast convergence of this algorithm.
    No preview · Article · Sep 2010 · Communications in Computational Physics