Related papers: Lower eigenvalue bounds with hybrid high-order met…
In this paper, we propose an interior-point method for linearly constrained optimization problems (possibly nonconvex). The method - which we call the Hessian barrier algorithm (HBA) - combines a forward Euler discretization of Hessian…
For a compact, connected, orientable Riemannian manifold with $b$ boundary components, we obtain geometric lower bounds for the low Steklov eigenvalues, namely $\sigma_k$, $1\le k\le b-1$. Our results complement earlier results, which apply…
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
A multigrid method is proposed for solving nonlinear eigenvalue problems by the finite element method. With this new scheme, solving nonlinear eigenvalue problem is decomposed to a series of solutions of linear boundary value problems on…
We associate a sequence of variational eigenvalues to any Radon measure on a compact Riemannian manifold. For particular choices of measures, we recover the Laplace, Steklov and other classical eigenvalue problems. In the first part of the…
Lieb has shown a lower bound on the smallest Dirichlet eigenvalue of the Laplace operator in terms of a generalized inradius. We derive similar bounds for Robin eigenvalues, for eigenvalues of the polyharmonic operator and the sub-Laplacian…
This work analyzes a high order hybridizable discontinuous Galerkin (HDG) method for the linear elasticity problem in a domain not necessarily polyhedral. The domain is approximated by a polyhedral computational domain where the HDG…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
In mixed finite element approximations of Hodge Laplace problems associated with the de Rham complex, the exterior derivative operators are computed exactly, so the spatial locality is preserved. However, the numerical approximations of the…
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…
We devise and analyze hybrid polyhedral methods of arbitrary order for the approximation of div-curl systems on three-dimensional domains featuring non-trivial topology. The div-curl systems we are interested in stem from magnetostatics,…
We present a unified description of extremal metrics for the Laplace and Steklov eigenvalues on manifolds of arbitrary dimension using the notion of $n$-harmonic maps. Our approach extends the well-known results linking extremal metrics for…
In this paper we study the approximation of eigenvalues arising from the mixed Hellinger--Reissner elasticity problem by using the simple finite element using partial relaxation of $C^0$ vertex continuity of stresses introduced recently by…
This article derives lower bounds on the convergence rate of continuous-time gradient-based optimization algorithms. The algorithms are subjected to a time-normalization constraint that avoids a reparametrization of time in order to make…
We investigate the Steklov eigenvalue problem in an exterior Euclidean domain. First, we present several formulations of this problem and establish the equivalences between them. Next, we examine various properties of the exterior Steklov…
We use layer potential to establish that the boundary biharmonic Steklov operators are elliptic pseudo-differential operators. Thus we are able to establish lower bounds on both the measure of boundary nodal sets and interior nodal sets for…
This paper proposes two convergent adaptive mesh-refining algorithms for the hybrid high-order method in convex minimization problems with two-sided p-growth. Examples include the p-Laplacian, an optimal design problem in topology…
In this paper, we present a multi-level mixed element scheme for the Helmholtz transmission eigenvalue problem on polygonal domains that are not necessarily able to be covered by rectangle grids. We first construct an equivalent linear…
This paper investigates the existence of positive solutions for regular discrete second-order single-variable boundary value problems with mixed boundary conditions, including a nonhomogeneous Dirichlet boundary condition, of the form:…