Related papers: Harmonic Extension
We present a new perspective on graph-based methods for collaborative ranking for recommender systems. Unlike user-based or item-based methods that compute a weighted average of ratings given by the nearest neighbors, or low-rank…
Partial differential equations (PDE) on manifolds arise in many areas, including mathematics and many applied fields. Among all kinds of PDEs, the Poisson-type equations including the standard Poisson equation and the related eigenproblem…
We introduce the harmonic virtual element method (harmonic VEM), a modification of the virtual element method (VEM) for the approximation of the 2D Laplace equation using polygonal meshes. The main difference between the harmonic VEM and…
We propose an improved Path Integral Monte Carlo (PIMC) algorithm called Harmonic PIMC (H-PIMC) and its generalization, Mixed PIMC (M-PIMC). PIMC is a powerful tool for studying quantum condensed phases. However, it often suffers from a low…
We study the $h$- and $p$-versions of non-conforming harmonic virtual element methods (VEM) for the approximation of the Dirichlet-Laplace problem on a 2D polygonal domain, providing quasi-optimal error bounds. Harmonic VEM do not make use…
Harmonic maps are nonlinear extensions of harmonic functions. They are critical points of natural energy functionals between Riemannian manifolds. Such type of problems appear in Physics, Geometry of Finance and the study of regularity and…
The Particle-in-Cell (PIC) simulation has been a widely used method for studying plasma physics. However, fully three-dimensional PIC simulations always require huge computational resources. For problems with near azimuthal symmetry, recent…
The phase-integral method (PIM) is an asymptotic method of the geometrical optics or semi-classical type for solving approximately, but in many cases very accurately, a wide class of differential equations in physics. Unlike the related…
Equilibrium equations in the form of complementarity conditions often appear as constraints in optimization problems. Problems of this type are commonly referred to as mathematical programs with complementarity constraints (MPCCs). A…
This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…
Maps from a source manifold $ {\mathcal M}$ to a target manifold ${\mathcal N}$ appear in liquid crystals, colour image enhancement, texture mapping, brain mapping, and many other areas. A numerical framework to solve variational problems…
We propose a multi-criteria Composite Index Method (CIM) to compare the performance of alternative approaches to solving an optimization problem. The CIM is convenient in those situations when neither approach dominates the other when…
Computing on encrypted data is a promising approach to reduce data security and privacy risks, with homomorphic encryption serving as a facilitator in achieving this goal. In this work, we accelerate homomorphic operations using the…
Integrals of the Liouville $1$-form, known as the first Poincar\'e integral invariant, provide a computable figure of merit for monitoring the conservation of symplecticity in the numerical integration of Hamiltonian systems. These…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…
One-dimensional function approximation is a fundamental problem in scientific computing and engineering applications. While neural networks possess powerful universal approximation capabilities, their optimization process is often hindered…
We propose a new nonconforming finite element algorithm to approximate the solution to the elliptic problem involving the fractional Laplacian. We first derive an integral representation of the bilinear form corresponding to the variational…
The coherent Ising machine (CIM) is a quantum-inspired computing platform that leverages optical parametric oscillation dynamics to solve combinatorial optimization problems by searching for the ground state of an Ising Hamiltonian.…
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…
Harmonic inversion has already been proven to be a powerful tool for the analysis of quantum spectra and the periodic orbit orbit quantization of chaotic systems. The harmonic inversion technique circumvents the convergence problems of the…