Related papers: Automated Bifurcation Analysis for Nonlinear Ellip…
This paper is a contribution to the study of regularity theory for nonlinear elliptic equations. The aim of this paper is to establish some global estimates for non-uniformly elliptic in divergence form as follows \begin{align*}…
This is the second part of a series devoting to the generalizations and applications of common theorems in variational bifurcation theory. Using abstract theorems in the first part we obtain many new bifurcation results for quasi-linear…
We study various partial data inverse boundary value problems for the semilinear elliptic equation $\Delta u+ a(x,u)=0$ in a domain in $\mathbb R^n$ by using the higher order linearization technique introduced in [LLS 19, FO19]. We show…
We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number…
We present a general technique, based on parametric search with some twist, for solving a variety of optimization problems on a set of semi-algebraic geometric objects of constant complexity. The common feature of these problems is that…
In this paper, we study the behavior of multiple continua of solutions to the semilinear elliptic problem \begin{equation*} \begin{cases} -\Delta u = \lambda f(u) &\text{ in } \Omega, u=0 &\text{ on } \partial\Omega, \end{cases}…
Finding equitable partitions is closely related to the extraction of graph symmetries and of interest in a variety of applications context such as node role detection, cluster synchronization, consensus dynamics, and network control…
We prove that solution operators of elliptic obstacle-type variational inequalities (or, more generally, locally Lipschitz continuous functions possessing certain pointwise-a.e. convexity properties) are Newton differentiable when…
We study the optimal approximation of the solution of an operator equation Au=f by linear and nonlinear mappings. We identify those cases where optimal nonlinear approximation is better than optimal linear approximation.
We study the optimal approximation of the solution of an operator equation Au=f by linear and nonlinear mappings.
This paper tackles the challenging problem of jointly inferring time-varying network topologies and imputing missing data from partially observed graph signals. We propose a unified non-convex optimization framework to simultaneously…
In this paper, based on the two-step discretization scheme proposed by Dahlquist, Liniger and Nevanlinna (DLN), we develop a semi-implicit Galerkin finite element method for solving the coupled generalized Ginzburg-Landau equations. By…
Graph representation learning is a ubiquitous task in machine learning where the goal is to embed each vertex into a low-dimensional vector space. We consider the bipartite graph and formalize its representation learning problem as a…
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…
For a strongly elliptic pseudodifferential operator $L$ of order $2a$ ($0<a<1$) with real kernel, we show an integration-by-parts formula for solutions of the homogeneous Dirichlet problem, in the model case where the operator is…
We study elliptic gradient systems with fractional laplacian operators on the whole space $$ (- \Delta)^\mathbf s \mathbf u =\nabla H (\mathbf u) \ \ \text{in}\ \ \mathbf{R}^n,$$ where $\mathbf u:\mathbf{R}^n\to \mathbf{R}^m$, $H\in…
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
We introduce a general, analytical framework to express and to approximate partial differential equations (PDEs) numerically on graphs and networks of surfaces---generalized by the term hypergraphs. To this end, we consider PDEs on…
It has been recently shown that a large class of balanced graph cuts allows for an exact relaxation into a nonlinear eigenproblem. We review briefly some of these results and propose a family of algorithms to compute nonlinear eigenvectors…
Numerical continuation calculations for ordinary differential equations (ODEs) are, by now, an established tool for bifurcation analysis in dynamical systems theory as well as across almost all natural and engineering sciences. Although…