An algorithm based on a compound matrix method is presented for solving difficult eigenvalue problems of n equation sets in connected domains that are coupled through (n -1) sets of interfacial boundary conditions, when n is an arbitrary number. As an example, a linear stability problem of n-layer p
Extremal Eigenvalue Problems for Starlike Planar Domains
β Scribed by S.J. Cox
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 854 KB
- Volume
- 120
- Category
- Article
- ISSN
- 0022-0396
No coin nor oath required. For personal study only.
β¦ Synopsis
Each eigenvalue of the Laplacian, subject to Dirichlet boundary conditions, is shown to attain its extremes over those open planar starlike sets that simultaneously (i) contain a given disk, (ii) occupy a given area, and (iii) do not exceed a prescribed perimeter. Over that subclass of starlike sets with Lipschitz boundary we compute the generalized gradient, with respect to domain, of each eigenvalue and deduce, from the ensuing necessary conditions, partial regularity of the extremal domains. 1995 Academic Press. Inc.
π SIMILAR VOLUMES
## Abstract This paper presents an efficient solution for solving the generalized eigenvalue equation arising in the finiteβelement (FE) formulation of propagation characterization of planar transmissionβline structures. A twoβdimensional (2βD) finiteβelement method (FEM) is used for analyzing the