Related papers: Stable Computation of Laplacian Eigenfunctions Cor…
In this paper, we investigate eigenvalues of the Dirichlet problem and the closed eigenvalue problem of drifting Laplacian on the complete metric measure spaces and establish the corresponding general formulas. By using those general…
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is widely used to compute eigenvalues of large sparse symmetric matrices. The algorithm can suffer from numerical instability if it is not implemented with care. This is…
A thorough backward stability analysis of Hotelling's deflation, an explicit external deflation procedure through low-rank updates for computing many eigenpairs of a symmetric matrix, is presented. Computable upper bounds of the loss of the…
The boundary integral equation method ascertains explicit relations between localized surface phonon and plasmon polariton resonances and the eigenvalues of its associated electrostatic operator. We show that group-theoretical analysis of…
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…
We study the limiting behavior of eigenfunctions/eigenvalues of the Laplacian of a family of Riemannian metrics that degenerates on a hypersurface. Our results generalize earlier work concerning the degeneration of hyperbolic surfaces.
A stabilized finite element method is introduced for the simulation of time-periodic creeping flows, such as those found in the cardiorespiratory systems. The new technique, which is formulated in the frequency rather than time domain,…
The stability of topological persistence is one of the fundamental issues in topological data analysis. Numerous methods have been proposed to address the stability of persistent modules or persistence diagrams. Recently, the concept of…
For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
We determine the shape which minimizes, among domains with given measure, the first eigenvalue of the anisotropic laplacian perturbed by an integral of the unknown function. Using also some properties related to the associated \lq\lq…
For odd anharmonic oscillators, it is well known that complex scaling can be used to determine resonance energy eigenvalues and the corresponding eigenvectors in complex rotated space. We briefly review and discuss various methods for the…
In this paper, we investigate eigenvalues of Laplacian on a bounded domain in an $n$-dimensional Euclidean space and obtain a sharper lower bound for the sum of its eigenvalues, which gives an improvement of results due to A. D. Melas [15].…
A computational linear stability analysis of spiral waves in a reaction-diffusion equation is performed on large disks. As the disk radius R increases, eigenvalue spectra converge to the absolute spectrum predicted by Sandstede and Scheel.…
We consider the Laplacian eigenvalues for smooth planar domains with strongly attractive Robin conditions imposed on a part of the boundary and Neumann condition on the remaining boundary. The asymptotics of individual eigenvalues is…
In this note, we study the spectrum of the Kohn Laplacian on the unit spheres in $\mathbb{C}^n$ and revisit Folland's classical eigenvalue computation. We also look at the growth rate of the eigenvalue counting function in this context.…
We compute numerically eigenvalues and eigenfunctions of the Laplacian in a three-dimensional hyperbolic space. Applying the results to cosmology, we demonstrate that the methods learned in quantum chaos can be used in other fields of…
This expository note explores Laplacian eigenfunction localization for compact domains. We work in the context of a particular numerically determined, localized, low frequency eigenfunction.
A Laplacian eigenfunction on a two-dimensional Riemannian manifold provides a natural partition into Neumann domains (a.k.a. a Morse--Smale complex). This partition is generated by gradient flow lines of the eigenfunction, which bound the…
Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix…