Related papers: Solving Local Linear Systems with Boundary Conditi…
We study the simulation of charged systems in the presence of general boundary conditions in a local Monte Carlo algorithm based on a constrained electric field. We firstly show how to implement constant-potential, Dirichlet, boundary…
We consider the heat-kernel on a manifold whose boundary is piecewise smooth. The set of independent geometrical quantities required to construct an expression for the contribution of the boundary discontinuities to the C_{2} heat-kernel…
A fundamental problem arising in many applications in Web science and social network analysis is, given an arbitrary approximation factor $c>1$, to output a set $S$ of nodes that with high probability contains all nodes of PageRank at least…
This paper investigates two inexact Levenberg-Marquardt (LM) methods for solving systems of nonlinear equations. Both approaches compute approximate search directions by solving the LM linear system inexactly, subject to specific…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
The kernel-based method has been successfully applied in linear system identification using stable kernel designs. From a Gaussian process perspective, it automatically provides probabilistic error bounds for the identified models from the…
We revisit the classic local graph exploration algorithm ApproxContributions proposed by Andersen, Borgs, Chayes, Hopcroft, Mirrokni, and Teng (WAW '07, Internet Math. '08) for computing an $\epsilon$-approximation of the PageRank…
Reduced modeling in high-dimensional reproducing kernel Hilbert spaces offers the opportunity to approximate efficiently non-linear dynamics. In this work, we devise an algorithm based on low rank constraint optimization and kernel-based…
Boundary integral methods for the solution of boundary value PDEs are an alternative to `interior' methods, such as finite difference and finite element methods. They are attractive on domains with corners, particularly when the solution…
In this work, we give a unifying view of locality in four settings: distributed algorithms, sequential greedy algorithms, dynamic algorithms, and online algorithms. We introduce a new model of computing, called the online-LOCAL model: the…
In this paper we consider non-local (in time) heat equations on time-increasing parabolic sets whose boundary is determined by a suitable curve. We provide a notion of solution for these equations and we study well-posedness under Dirichlet…
The "Local Ranking Problem" (LRP) is related to the computation of a centrality-like rank on a local graph, where the scores of the nodes could significantly differ from the ones computed on the global graph. Previous work has studied LRP…
In this article a simplified weak Galerkin finite element method is developed for the Dirichlet boundary value problem of convection-diffusion-reaction equations. The simplified weak Galerkin method utilizes only the degrees of freedom on…
Many algorithms for ranked data become computationally intractable as the number of objects grows due to the complex geometric structure induced by rankings. An additional challenge is posed by partial rankings, i.e. rankings in which the…
In this paper we propose a Local Orthogonal Decomposition method (LOD) for elliptic partial differential equations with inhomogeneous Dirichlet- and Neumann boundary conditions. For this purpose, we present new boundary correctors which…
In this paper, we are interested in numerical solution of some linear boundary value problems with Dirichlet boundary part, by the means of simulation of random walks. We use a probabilistic interpretation of solution $u$, assuming that the…
In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms)…
We study heat semigroups generated by self-adjoint Laplace operators on metric graphs characterized by the property that the local scattering matrices associated with each vertex of the graph are independent from the spectral parameter. For…
New algorithms are presented for numerical conformal mapping based on rational approximations and the solution of Dirichlet problems by least-squares fitting on the boundary. The methods are targeted at regions with corners, where the…
This work develops a computational framework that combines physics-informed neural networks with multi-patch isogeometric analysis to solve partial differential equations on complex computer-aided design geometries. The method utilizes…