๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Laplacian eigenvalues of a polygon

โœ Scribed by P. Grinfeld; G. Strang

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
986 KB
Volume
48
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

The difficulties are almost always at the boundary." That statement applies to the solution of partial differentiM equations (with a given boundary) and also to shape optimization (with an unknown boundary). These problems require two decisions, closely related but not identical:

  1. How to discretize the boundary conditions. 2. How to discretize the boundary itself. That second problem is the one we discuss here. The region ~ is frequently replaced by a polygon or polyhedron. The approximate boundary O~2N may be only a lineal" interpolation of the true boundary 0~. A perturbation theory that applies to smooth changes of domain is often less successful for a polygon. This paper concentrates on a model problem--the simplest we could find--and we look at eigenvalues of the Laplacian.

The boundary 0~t will be the unit circle. The approximate boundary O~g is the regular inscribed polygon with N equal sides. It seems impossible that the eigenvalues of regular polygons have not been intensively studied, but we have not yet located an authoritative reference. The problem will be approached numerically from three directions, without attempting a general theory. Those directions are:

  1. Finite-element discretizations of the polygons ~N. 2. A Taylor series based on piecewise smooth perturbations of the circle.

  2. A series expansion of the eigenvalues in powers of 1/N.

The second author particularly wishes that we could have consulted George Fix about this problem. His Harvard thesis demonstrated the tremendous improvement that "singular elements" can bring to the finite-element method (particularly when ~ has a reentrant corner, or even a crack). His numerical experiments in [1] came at the beginning of a long and successful career in applied mathematics. We only wish it had been longer.

๐Ÿ“œ SIMILAR VOLUMES

EIGENVALUES OF THE LAPLACIAN ON REGULAR
EIGENVALUES OF THE LAPLACIAN ON REGULAR POLYGONS AND POLYGONS RESULTING FROM THEIR DISECTION
โœ L.M. Cureton; J.R. Kuttler ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

The eigenvalue problem is considered for the Laplacian on regular polygons, with either Dirichlet or Neumann boundary conditions, which will be related to the unit circle by a conformal mapping. The polygonal problem is then equivalent to a weighted eigenvalue problem on the circle with the same bou

On the Laplacian eigenvalues of a graph
On the Laplacian eigenvalues of a graph
โœ Jiong-Sheng Li; Xiao-Dong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

In the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a "2-degree" of a vertex.

The kth Laplacian eigenvalue of a tree
The kth Laplacian eigenvalue of a tree
โœ Ji-Ming Guo ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 102 KB

## Abstract Let ฮป~__k__~(__G__) be the __k__th Laplacian eigenvalue of a graph __G__. It is shown that a tree __T__ with __n__ vertices has $\lambda\_{k}(T)\le \lceil { {n}\over{k}}\rceil$ and that equality holds if and only if __k__ < __n__, __k__|__n__ and __T__ is spanned by __k__ vertex disjoin

Eigenvalues of the -Laplacian Neumann pr
Eigenvalues of the -Laplacian Neumann problems
โœ Xianling Fan ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

We study the eigenvalues of the p(x)-Laplacian operator with zero Neumann boundary condition on a bounded domain, where p(x) is a continuous function defined on the domain with p(x) > 1. We show that, similarly to the p-Laplacian case, the smallest eigenvalue of the problem is 0 and it is simple, an