Related papers: Stable Computation of Laplacian Eigenfunctions Cor…
We are interested in the question of stability in the field of shape optimization, with focus on the strategy using second order shape derivative. More precisely, we identify structural hypotheses on the hessian of the considered shape…
A defective eigenvalue is well documented to be hypersensitive to data perturbations and round-off? errors, making it a formidable challenge in numerical computation particularly when the matrix is known through approximate data. This paper…
A numerical algorithm for explicitly computing the spectrum of the Laplace-Beltrami operator on Calabi-Yau threefolds is presented. The requisite Ricci-flat metrics are calculated using a method introduced in previous papers. To illustrate…
Nonlinear reformulations of the spectral clustering method have gained a lot of recent attention due to their increased numerical benefits and their solid mathematical background. We present a novel direct multiway spectral clustering…
We are concerned with the study of some classical spectral collocation methods as well as with the new software system Chebfun in computing high order eigenpairs of singular and regular Schrodinger eigenproblems. We want to highlight both…
In spectral clustering, one defines a similarity matrix for a collection of data points, transforms the matrix to get the Laplacian matrix, finds the eigenvectors of the Laplacian matrix, and obtains a partition of the data using the…
Various physical models can be expressed in terms of matrices. A valuable tool for analysing matrix models is numerical simulations, often the Metropolis algorithm with various improvements. The downside of this approach is that the…
The two-step spectral clustering method, which consists of the Laplacian eigenmap and a rounding step, is a widely used method for graph partitioning. It can be seen as a natural relaxation to the NP-hard minimum ratio cut problem. In this…
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower…
We consider the "Method of particular solutions" for numerically computing eigenvalues and eigenfunctions of the Laplacian $\Delta$ on a smooth, bounded domain Omega in RR^n with either Dirichlet or Neumann boundary conditions. This method…
This is a survey on eigenfunctions of the Laplacian on Riemannian manifolds (mainly compact and without boundary). We discuss both local results obtained by analyzing eigenfunctions on small balls, and global results obtained by wave…
The nonlinear space-fractional problems often allow multiple stationary solutions, which can be much more complicated than the corresponding integer-order problems. In this paper, we systematically compute the solution landscapes of…
In this paper, we give some lower bounds for several eigenvalues. Firstly, we investigate the eigenvalues $\lambda_i$ of the Laplace operator and prove a sharp lower bound. Moreover, we extent this estimate of the eigenvalues to general…
The Laplace eigenvalue problem on circular sectors has eigenfunctions with corner singularities. Standard methods may produce suboptimal approximation results. To address this issue, a novel numerical algorithm that enhances standard…
We consider a "convolution mm-Laplacian" operator on metric-measure spaces and study its spectral properties. The definition is based on averaging over small metric balls. For reasonably nice metric-measure spaces we prove stability of…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
We look at the $L^p$ bounds on eigenfunctions for polygonal domains (or more generally Euclidean surfaces with conic singularities) by analysis of the wave operator on the flat Euclidean cone $C(\mathbb{S}^1_\rho) := \mathbb{R}_+ \times…
It is well known that Cauchy problem for Laplace equations is an ill-posed problem in Hadamard's sense. Small deviations in Cauchy data may lead to large errors in the solutions. It is observed that if a bound is imposed on the solution,…
With the development of quantum algorithms, high-cost computations are being scrutinized in the hope of a quantum advantage. While graphs offer a convenient framework for multiple real-world problems, their analytics still comes with high…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…