Related papers: Analysis on the Projective Octagasket
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function whose gradient is…
In purely non-dissipative systems, Lagrangian and Hamiltonian reduction have proven to be powerful tools for deriving physical models with exact conservation laws. We have discovered a hint that an analogous reduction method exists also for…
A new computational algorithm, the discrete singular convolution (DSC), is introduced for computational electromagnetics. The basic philosophy behind the DSC algorithm for the approximation of functions and their derivatives is studied.…
We consider the homogeneous Dirichlet problem for the integral fractional Laplacian $(-\Delta)^s$. We prove optimal Sobolev regularity estimates in Lipschitz domains provided the solution is $C^s$ up to the boundary. We present the…
In this work, we examine the relationship between geometry and spectrum of regions with fractal boundary. The relationship is well-understood for fractal harps in one dimension, but largely open for fractal drums in larger dimensions. To…
Spectrum of the Laplacian on spherical domains is analyzed from the point of view of the heat equation on the cone. The series solution to the heat equation on the cone is known to lead to a study of the Laplacian eigenvalue problem on…
In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…
We consider the isogeometric analysis for fractional PDEs involving the fractional Laplacian in two dimensions. An isogeometric collocation method is developed to discretize the fractional Laplacian and applied to the fractional Poisson…
Let $(M,g)$ be a compact smoothly stratified pseudomanifold with an iterated cone-edge metric satisfying a spectral Witt condition. Under these assumptions the Hodge-Laplacian $\Delta$ is essentially self-adjoint. We establish the…
We present a method to approximate pairwise distance on a graph, having an amortized sub-linear complexity in its size. The proposed method follows the so called heat method due to Crane et al. The only additional input are the values of…
This paper presents and investigates an inexact proximal gradient method for solving composite convex optimization problems characterized by an objective function composed of a sum of a full-domain differentiable convex function and a…
Eigenvectors and eigenvalues of discrete graph Laplacians are often used for manifold learning and nonlinear dimensionality reduction. It was previously proved by Belkin and Niyogi that the eigenvectors and eigenvalues of the graph…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
This paper is concerned with the semilinear damped wave equation on a measure space with a self-adjoint operator, instead of the standard Laplace operator. Under a certain decay estimate on the corresponding heat semigroup, we establish the…
We study a nonlinear elliptic problem defined in a bounded domain involving fractional powers of the Laplacian operator together with a concave-convex term. We characterize completely the range of parameters for which solutions of the…
For an embedded submanifold $\Sigma\subset\mathbb{R}^{N}$, Belkin and Niyogi showed that one can approximate the Laplacian operator using heat kernels. Using a definition of coarse Ricci curvature derived by iterating Laplacians, we…
This work provides an extension of parts of the classical finite dimensional sub-elliptic theory in the context of infinite dimensional compact connected metrizable groups. Given a well understood and well behaved bi-invariant Laplacian,…
A grid-overlay finite difference method is proposed for the numerical approximation of the fractional Laplacian on arbitrary bounded domains. The method uses an unstructured simplicial mesh and an overlay uniform grid for the underlying…
Many applications using large datasets require efficient methods for minimizing a proximable convex function subject to satisfying a set of linear constraints within a specified tolerance. For this task, we present a proximal projection…
The magnetic Laplacian (also called the line bundle Laplacian) on a connected weighted graph is a self-adjoint operator wherein the real-valued adjacency weights are replaced by unit complex-valued weights $\{\omega_{xy}\}_{xy\in E}$,…