Related papers: A Hierarchical Method for obtaining Eigenvalue Enc…
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 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…
A numerical procedure providing guaranteed two-sided bounds on the effective coefficients of elliptic partial differential operators is presented. The upper bounds are obtained in a standard manner through the variational formulation of the…
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…
Under various elliptic boundary conditions, we obtain lower eigenvalue estimates for Dirac operators by using Hormander's weighted $L^2$-technique. Lower bounds in terms of the volume of the underlying manifolds are also deduced from the…
We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…
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 derive a new homotopy formula for a strictly pseudoconvex domain of $C^2$ boundary in ${\mathbf C}^n$ by using a method of Lieb and Range and obtain estimates in Lipschitz spaces for the homotopy operators. For $r>1$ and $q>0$, we obtain…
This paper gives a framework to produce the lower bound of eigenvalues defined in a Hilbert space by the eigenvalues defined in another Hilbert space. The method is based on using the max-min principle for the eigenvalue problems.
The convergence of the so-called quadratic method for computing eigenvalue enclosures of general self-adjoint operators is examined. Explicit asymptotic bounds for convergence to isolated eigenvalues are found. These bounds turn out to…
It is shown how mixed finite element methods for symmetric positive definite eigenvalue problems related to partial differential operators can provide guaranteed lower eigenvalue bounds. The method is based on a classical compatibility…
We obtain sharp uniform bounds on the low lying eigenfunctions for a class of semiclassical pseudodifferential operators with double characteristics and complex valued symbols, under the assumption that the quadratic approximations along…
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…
We obtain tight upper and lower bounds to the eigenvalues of an anharmonic oscillator with a rational potential. We compare our bounds with results given by other approaches.
Let $\Omega$ be an open, simply connected, and bounded region in $\mathbb{R}^{d}$, $d\geq2$, and assume its boundary $\partial\Omega$ is smooth. Consider solving the eigenvalue problem $Lu=\lambda u$ for an elliptic partial differential…
We discuss how to compute certified enclosures for the eigenvalues of benchmark linear magnetohydrodynamics operators in the plane slab and cylindrical pinch configurations. For the plane slab, our method relies upon the formulation of an…
We show that the eigenvalues of the intrinsic Dirac operator on the boundary of a Euclidean domain can be obtained as the limits of eigenvalues of Euclidean Dirac operators, either in the domain with a MIT-bag type boundary condition or in…
When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…
We lay down the foundations of the Eigenvalue Method in coding theory. The method uses modern algebraic graph theory to derive upper bounds on the size of error-correcting codes for various metrics, addressing major open questions in the…
In this paper, we compute universal estimates of eigenvalues for a class of coupled systems of elliptic differential equations in divergence form on a bounded domain in Euclidean space, which includes the well-known Lam\'e and the Laplacian…