An algorithm for identifying eigenvectors exhibiting strong spatial localization

05/29/2021
by   Jeffrey Ovall, et al.
0

We introduce an approach for exploring eigenvector localization phenomena for a class of (unbounded) selfadjoint operators. More specifically, given a target region and a tolerance, the algorithm identifies candidate eigenpairs for which the eigenvector is expected to be localized in the target region to within that tolerance. Theoretical results, together with detailed numerical illustrations of them, are provided that support our algorithm. A partial realization of the algorithm is described and tested, providing a proof of concept for the approach.

READ FULL TEXT

page 9

page 14

page 18

page 19

research
02/14/2012

Near-Optimal Target Learning With Stochastic Binary Signals

We study learning in a noisy bisection model: specifically, Bayesian alg...
research
01/25/2015

Unsupervised Object Discovery and Localization in the Wild: Part-based Matching with Bottom-up Region Proposals

This paper addresses unsupervised discovery and localization of dominant...
research
02/16/2021

Unbiased simulation of rare events in continuous time

For rare events described in terms of Markov processes, truly unbiased e...
research
06/18/2019

Gap-Increasing Policy Evaluation for Efficient and Noise-Tolerant Reinforcement Learning

In real-world applications of reinforcement learning (RL), noise from in...
research
10/20/2022

A Gauss Laguerre approach for the resolvent of fractional powers

This paper introduces a very fast method for the computation of the reso...
research
09/18/2022

Bayesian tolerance regions with an application to linear mixed models

We review and contrast frequentist and Bayesian definitions of tolerance...
research
08/02/2016

Global Vertices and the Noising Paradox

A theoretical and experimental analysis related to the identification of...

Please sign up or login with your details

Forgot password? Click here to reset