Abstract

A numerical method for the eigenvalue problem of the Laplacian in two-dimensional domains is developed in this paper. This method requires $O( N )$ operations for calculating one eigenvalue in each iteration step, where N is the number of boundary points in the discretization. It is based on the boundary integral formulation which reduces the computation of the eigenvalues to the zeros of the function $\mu _1 ( \lambda )$ defined as the smallest eigenvalue of a related matrix. Iteration methods such as the Lanczos method are used to compute $\mu_1 ( \lambda )$, which requires the multiplication of an $N \times N$ matrix with a vector. The multipole expansion techniques developed for the potential problems by Rokhlin [J. Comput. Phys., 60 (1985), pp. 187–207] are applied and extended here, and the number of operations is reduced to $O( N )$ for this multiplication. The zeros of $\mu _1 ( \lambda )$ are found by the method of quadratic interpolation. A method for finding the kth eigenvalue with the value of k prespecified is also presented. It is based on continuously tracing the eigenvalue while the domain is deforming to (or from) the unit disk. Only five values of $\mu _1 $ are required in this tracing process.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.