Related papers: Convergence, optimization and stability of singula…

Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any…

We prove existence results for optimization problems for the $k$th Laplace eigenvalue on closed Riemannian manifolds of dimension $m \geq 3$, depending on the choice of normalization. One such normalization leads to eigenvalue optimization…

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…

We study the high-frequency behavior of the Dirichlet-to-Neumann map for an arbitrary compact Riemannian manifold with a non-empty smooth boundary. We show that far from the real axis it can be approximated by a simpler operator. We use…

Subspace methods are commonly used for finding approximate eigenvalues and singular values of large-scale matrices. Once a subspace is found, the Rayleigh-Ritz method (for symmetric eigenvalue problems) and Petrov-Galerkin projection (for…

This paper is concerned with the Dirichlet eigenvalue problem for Laplace operator in a bounded domain with periodic perforation in the case of small volume. We obtain the optimal quantitative error estimates independent of the spectral…

Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…

We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…

We prove that in many cases the existence of an extremal metric for some Laplace eigenvalue in a conformal class allows to find extremal metrics in conformal classes close by. As a consequence and as part of the arguments we obtain…

Reliable and efficient computation of the pseudospectral abscissa in the large-scale setting is still not settled. Unlike the small-scale setting where there are globally convergent criss-cross algorithms, all algorithms in the large-scale…

Motivated by the problem of the small-scale sign distribution of Laplace eigenfunctions, we introduce a strong notion of sign-balance for (eigen)functions, and prove that random eigenfunctions are sign-balanced above a precisely determined…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

We prove stability estimates for the isoperimetric inequalities for the first and the second nonzero Laplace eigenvalues on surfaces, both globally and in a fixed conformal class. We employ the notion of eigenvalues of measures and show…

The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…

A fundamental tool in shape analysis is the virtual embedding of the Riemannian manifold describing the geometry of a shape into Euclidean space. Several methods have been proposed to embed isometric shapes in flat domains while preserving…

This article is an expanded version of the plenary talk given by Evans Harrell at QMath98, a meeting in Prague, June 1998. We consider Laplace operators and Schr\"odinger operators with potentials containing curvature on certain regions of…

Image segmentation is an inherently ill-posed problem and thus requires regularization in order to limit the search space to reasonable solutions. A majority of segmentation methods integrates these regularization terms in one way or the…

In this paper we study the statistical properties of Principal Components Regression with Laplacian Eigenmaps (PCR-LE), a method for nonparametric regression based on Laplacian Eigenmaps (LE). PCR-LE works by projecting a vector of observed…

We introduce a framework for repurposing error estimators for source problems to compute an estimator for the gap between eigenspaces and their discretizations. Of interest are eigenspaces of finite clusters of eigenvalues of unbounded…