Email 中文


How well can we hear the shape of a drum by computer algorithms?

  • Speaker: Zhimin Zhang (Beijing Computational Science Research Center)

  • Time: Jan 7, 2019, 14:30-15:30

  • Location: Conference Room 415, Hui Yuan 3#

Abstract: Can we determine the shape of a domain by its Laplacian eigenvalues? The question puzzled us for many years until 1992, when three mathematicians surprised everyone by a counterexample. However, this is not the end of the story to applied mathematicians, since in most cases we are unable to obtain exact eigenvalues and the numerical approximation by computer algorithms is necessary. Naturally, another question arises: How many numerical eigenvalues can we trust? When approximating PDE eigenvalue problems by numerical methods such as finite difference and finite element, it is common knowledge that only a small portion of numerical eigenvalues are reliable. However, this knowledge is only qualitative rather than quantitative in the literature. In this talk, I will first survey some theoretical results from pure mathematics regarding eigenvalue problems. Then I will investigate the number of “trusted” eigenvalues by the finite element (and the related finite difference method results obtained from mass lumping) approximation of 2mth order elliptic PDE eigenvalue problems. Our two model problems are the Laplace and bi-harmonic operators, for which a solid knowledge regarding magnitudes of eigenvalues are available in the literature. Combining this knowledge with a priori error estimates of the finite element method, we are able to figure out roughly how many “reliable” eigenvalues can be obtained from numerical approximation under a pre-determined convergence rate.

Bio: Zhimin Zhang received his B.S. (1982) and M.S. (1985) from University of Science and Technology of China, and his Ph.D. from University of Maryland at College Park (1991). He was appointed Visiting Assistant Professor and Assistant Professor (Tenure-track) in the Department of Mathematics at Texas Tech University in 1991 and 1993, respectively, and promoted to Associate Professor with tenure in 1997. He joined Wayne State University (WSU) as an Associate Professor in the Department of Mathematics in 1999 and was promoted to a full Professor in 2002. He was a Visiting Professor at Cornell University (2002) and Penn State University (2004). He is a Charles H. Gershenson Distinguished Faculty Fellow of WSU (2014). He joined Beijing Computational Science Research Center (CSRC) in 2012. He has served on editorial boards of eight professional journals including “Mathematics of Computation” and “Journal of Scientific Computing”.