Related papers: How Many Numerical Eigenvalues can We Trust?
In this paper we consider approximations of Neumann problems for the integral fractional Laplacian by continuous, piecewise linear finite elements. We analyze the weak formulation of such problems, including their well-posedness and…
A class of discrete equations is considered from three perspectives corresponding to three measures of the complexity of solutions: the (hyper-) order of meromorphic solutions in the sense of Nevanlinna, the degree growth of iterates over a…
We present some new nonparametric estimators of entropies and we establish almost sure consistency and central limit Theorems for some of the most important entropies in the discrete case. Our theorical results are validated by simulations.
The eigenvalue bounds obtained earlier [J. Phys. A: Math. Gen. 31 (1998) 963] for smooth transformations of the form V(x) = g(x^2) + f(1/x^2) are extended to N-dimensions. In particular a simple formula is derived which bounds the…
Credal sets, i.e., closed convex sets of probability measures, provide a natural framework to represent aleatoric and epistemic uncertainty in machine learning. Yet how to quantify these two types of uncertainty for a given credal set,…
The empirical eigenvalue distribution of the elliptic random matrix ensemble tends to the uniform measure on an ellipse in the complex plane as its dimension tends to infinity. We show this convergence on all mesoscopic scales slightly…
Specially customised Entropies are widely applied in measuring the degree of uncertainties existing in the frame of discernment. However, all of these entropies regard the frame as a whole that has already been determined which dose not…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
In this work, we propose a numerical method based on high degree continuous nodal elements for the Cahn-Hilliard evolution. The use of the p-version of the finite element method proves to be very efficient and favorably compares with other…
In this paper, we consider the problem of making skeptical inferences for the multi-label ranking problem. We assume that our uncertainty is described by a convex set of probabilities (i.e. a credal set), defined over the set of labels.…
We study real eigenvalues of $N\times N$ real elliptic Ginibre matrices indexed by a non-Hermiticity parameter $0\leq \tau<1$, in both the strong and weak non-Hermiticity regime. Here $N$ is assumed to be an even number. In both regimes, we…
We establish two new estimates which control a function (after subtracting its average) in $L^1$ by only the $L^1$ norm of its radial derivative. While the interior estimate holds for all superharmonic functions, the boundary version is…
We consider the empirical eigenvalue distribution of an $m\times m$ principal submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. For $n$ and $m$ large with $\frac{m}{n}=\alpha$, the empirical spectral…
We consider the approximation of elliptic eigenvalue problem with an immersed interface. The main aim of this paper is to prove the stability and convergence of an immersed finite element method (IFEM) for eigenvalues using Crouzeix-Raviart…
Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications and it is a prerequisite of eigensolvers based on a divide-and-conquer paradigm. Often an…
Certified randomness guaranteed to be unpredictable by adversaries is central to information security. The fundamental randomness inherent in quantum physics makes certification possible from devices that are only weakly characterised, i.e.…
If several independent algorithms for a computer-calculated quantity exist, then one can expect their results (which differ because of numerical errors) to follow approximately Gaussian distribution. The mean of this distribution,…
We present a new numerical technique to solve large-scale eigenvalue problems. It is based on the projection technique, used in strongly correlated quantum many-body systems, where first an effective approximate model of smaller complexity…
The most common method for calculating accurate numerical solutions for complicated linear differential equations - for example, finding eigenvalues and eigenfunctions of the Schrodinger equation for many-electron atoms - is the variational…
This paper considers the estimation of Shannon entropy for discrete distributions with countably infinite support. While minimax rates for finite-support distributions are established, infinite-support distributions present distinct…