Related papers: A Small Note About Lower Bound of Eigenvalues

In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.

This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved…

This article is devoted to computing the lower and upper bounds of the Laplace eigenvalue problem. By using the special nonconforming finite elements, i.e., enriched Crouzeix-Raviart element and extension $Q_1^{\rm rot}$, we get the lower…

In this paper, we propose an unconstrained framework for eigenvalue problems in both discrete and continuous settings. We begin our discussion to solve a generalized eigenvalue problem $A{\bf x} = \lambda B{\bf x}$ with two $N\times N$ real…

We consider the problem of minimising the $L^\infty$ norm of a function of the hessian over a class of maps, subject to a mass constraint involving the $L^\infty$ norm of a function of the gradient and the map itself. We assume zeroth and…

We provide two new methods for computing lower bounds of eigenvalues of symmetric elliptic second-order differential operators with mixed boundary conditions of Dirichlet, Neumann, and Robin type. The methods generalize ideas of Weinstein's…

We propose a method for obtaining rigorous and accurate upper and lower bounds on the eigenvalues of ordinary and partial differential operators in bounded regions of Euclidean space. It uses a boundary condition homotopy method starting…

This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…

A method to compute guaranteed lower bounds to the eigenvalues of the Maxwell system in two or three space dimensions is proposed as a generalization of the method of Liu and Oishi [SIAM J. Numer. Anal., 51, 2013] for the Laplace operator.…

The aim of the paper is to introduce a new systematic method that can produce lower bounds for eigenvalues. The main idea is to use nonconforming finite element methods. The general conclusion herein is that if local approximation…

For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…

We demonstrate lower bounds for the eigenvalues of compact Bakry-Emery manifolds with and without boundary. The lower bounds for the first eigenvalue rely on a generalised maximum principle which allows gradient estimates in the Riemannian…

By using Bochner technique and gradient estimate, we give the lower bound estimates of the first eigenvalue of Finsler-Laplacian on Finsler manifolds. These results generalize the corresponding famous theorems in the Riemannian geometry.

In this article, we study eigenvalue problems associated to self-adjoint operators and their approximation obtained by subspace projection, as used in the reduced basis method for instance. We provide error bounds between the exact…

In this note we discuss an abstract framework for standard boundary value problems in divergence form with maximal monotone relations as "coefficients". A reformulation of the respective problems is constructed such that they turn out to be…

In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given values of the minimum rank distance. We computationally compare…

Let $\om $ be a bounded domain in an $n$-dimensional Euclidean space $\Bbb R^n$. We study eigenvalues of an eigenvalue problem of a system of elliptic equations: $$ \{\aligned &\Delta {\mathbf u}+ \alpha{\rm grad}(\text{div}{\mathbf…

We consider the minimization or maximization of the $J$th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting…