Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEigenvalue enclosures
150
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper is concerned with methods for numerical computation of eigenvalue enclosures. We examine in close detail the equivalence between an extension of the Lehmann-Maehly-Goerisch method developed a few years ago by Zimmermann and Mertins, and a geometrically motivated method developed more recently by Davies and Plum. We extend various previously known results in the theory and establish explicit convergence estimates in both settings. The theoretical results are supported by two benchmark numerical experiments on the isotropic Maxwell eigenvalue problem.
rate research
Read More
A certified strategy for determining sharp intervals of enclosure for the eigenvalues of matrix differential operators with singular coefficients is examined. The strategy relies on computing the second order spectrum relative to subspaces of continuous piecewise linear functions. For smooth perturbations of the angular Kerr-Newman Dirac operator, explicit rates of convergence due to regularity of the eigenfunctions are established. Existing benchmarks are validated and sharpened by several orders of magnitude in the unperturbed setting.
We propose employing the extension of the Lehmann-Maehly-Goerisch method developed by Zimmermann and Mertins, as a highly effective tool for the pollution-free finite element computation of the eigenfrequencies of the resonant cavity problem on a bounded region. This method gives complementary bounds for the eigenfrequencies which are adjacent to a given real parameter. We present a concrete numerical scheme which provides certified enclosures in a suitable asymptotic regime. We illustrate the applicability of this scheme by means of some numerical experiments on benchmark data using Lagrange elements and unstructured meshes.
We show that Selbergs eigenvalue conjecture concerning small eigenvalues of the automorphic Laplacian for congruence groups is equivalent to a conjecture about the non-existence of residual eigenvalues for a perturbed system. We prove this using a combination of methods from asymptotic perturbation theory and number theory.
We address the problem of computing the smallest symplectic eigenvalues and the corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamsons theorem. It is formulated as minimizing a trace cost function over the symplectic Stiefel manifold. We first investigate various theoretical aspects of this optimization problem such as characterizing the sets of critical points, saddle points, and global minimizers as well as proving that non-global local minimizers do not exist. Based on our recent results on constructing Riemannian structures on the symplectic Stiefel manifold and the associated optimization algorithms, we then propose solving the symplectic eigenvalue problem in the framework of Riemannian optimization. Moreover, a connection of the sought solution with the eigenvalues of a special class of Hamiltonian matrices is discussed. Numerical examples are presented.
We revisit classical eigenvalue inequalities due to Buser, Cheng, and Gromov on closed Riemannian manifolds, and prove t
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
