Related papers: The Infinity Laplacian eigenvalue problem: reformu…
A new idea to approximate the second eigenfunction and the second eigenvalue of $p$-Laplace operator is given. In the case of the Dirichlet boundary condition, the scheme has the restriction that the positive and the negative part of the…
A multiscale optimization framework for problems over a space of Lipschitz continuous functions is developed. The method solves a coarse-grid discretization followed by linear interpolation to warm-start project gradient descent on…
In this paper we discuss reduced order models for the approximation of parametric eigenvalue problems. In particular, we are interested in the presence of intersections or clusters of eigenvalues. The singularities originating by these…
We consider a magnetic Laplacian on a geometrically finite hyperbolic surface, when the corresponding magnetic field is infinite at the boundary at infinity. We prove that the counting function of the eigenvalues has a particular asymptotic…
We study a nonlinear, nonlocal eigenvalue problem driven by the fractional p-Laplacian with an indefinite, singular weight chosen in an optimal class. We prove the existence of an unbounded sequence of positive variational eigenvalues and…
We obtain a new upper bound for Neumann eigenvalues of the Laplacian on a bounded convex domain in Euclidean space. As an application of the upper bound we derive universal inequalities for Neumann eigenvalues of the Laplacian.
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.
We explore the connection between fractional order partial differential equations in two or more spatial dimensions with boundary integral operators to develop techniques that enable one to efficiently tackle the integral fractional…
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the…
We formulate the immersed-boundary method (IBM) as an inverse problem. A control variable is introduced on the boundary of a larger domain that encompasses the target domain. The optimal control is the one that minimizes the mismatch…
In this paper we consider the numerical approximation of the two-phase membrane (obstacle) problem by finite difference method. First, we introduce the notion of viscosity solution for the problem and construct certain discrete nonlinear…
The purpose of this article is to approximately compute the eigenvalues of the symmetric Dirichlet Laplacian within an interval $(0,\Lambda)$. A novel domain decomposition Ritz method, partition of unity condensed pole interpolation method,…
Spectral methods include a family of algorithms related to the eigenvectors of certain data-generated matrices. In this work, we are interested in studying the geometric landscape of the eigendecomposition problem in various spectral…
In this paper, we consider the principal eigenvalue problem for Hormander's laplacian on $R^n$. We also study a related semi-linear sub-elliptic equation in the whole $R^n$ and prove that under a suitable condition, we have infinite many…
In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…
A new algorithm for time dependent Hamilton Jacobi equations on networks, based on semi Lagrangian scheme, is proposed. It is based on the definition of viscosity solution for this kind of problems recently given in. A thorough convergence…
Many models require integrals of high-dimensional functions: for instance, to obtain marginal likelihoods. Such integrals may be intractable, or too expensive to compute numerically. Instead, we can use the Laplace approximation (LA). The…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We develop a computational method for extremal Steklov eigenvalue problems and apply it to study the problem of maximizing the $p$-th Steklov eigenvalue as a function of the domain with a volume constraint. In contrast to the optimal…