Related papers: Split-harmonic maps and the interpolation problem …
We study the problem of finding unitary submatrices of the $N \times N$ discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of…
In this paper, we present the first uniqueness result on the bounded time inverse scattering problem for a semilinear Dirac equation with smooth nonlinearity $F(x, z)$ where $(x, z)\in \mathbb{R}^3\times \mathbb{C}^4$ and $x$ is the spatial…
In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…
In this paper, we investigate the interpolation of surfaces which are obtained from an isoasymptotic curve in 3D-Euclidean space. We prove that there exist a unique $ C^0 $-Hermite surface interpolation related to an isoasymptotic curve…
We propose a sparse interpolation construction and a practical coarsening algorithm for the algebraic multigrid (AMG) method, tailored towards H(curl). Building on the generalized AMG framework, we introduce an interior/exterior splitting…
We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time…
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
We consider a scalar objective minimization problem over the solution set of another optimization problem. This problem is known as simple bilevel optimization problem and has drawn a significant attention in the last few years. Our inner…
We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect…
Joint object matching, also known as multi-image matching, namely, the problem of finding consistent partial maps among all pairs of objects within a collection, is a crucial task in many areas of computer vision. This problem subsumes…
We prove the uniqueness of solutions to Dirichlet problem for p-harmonic maps with images in a small geodesic ball of the target manifold. As a consequence, we show that such maps have Hoelder continuous derivatives. This gives an extension…
We find time discretizations for the two ''second flows'' of the Ablowitz-Ladik hierachy. These discretizations are described by local equations of motion, as opposed to the previously known ones, due to Taha and Ablowitz. Certain…
We study shortest-path routing in large weighted, undirected graphs, where expanding search frontiers raise time and memory costs for exact solvers. We propose \emph{SPHERE}, a query-aware partitioning heuristic that adaptively splits the…
In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…
Fold maps are higher dimensional versions of Morse functions, which play important roles in the studies of smooth manifolds, and such general maps also have been fundamental tools in the studies of smooth manifolds by using generic maps. In…
Interpolation Theory gives techniques for constructing spaces from two initial Banach spaces. We provide several conditions under which the restriction of a holomorphic map $f:X_0+X_1 \rightarrow Y_0+Y_1$ to the interpolated spaces (using…
The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint subsets with limited size and the classical Min-Max Weighted…
Biharmonic wave equations are of importance to various applications including thin plate analyses. In this work, the numerical approximation of their solutions by a $C^1$-conforming in space and time finite element approach is proposed and…
Graph signal processing benefits significantly from the direct and highly adaptable supplementary techniques offered by partition of unity methods (PUMs) on graphs. In our approach, we demonstrate the generation of a partition of unity…
In this paper, we prove that time-like constant slope surfaces can be reparametrized by using rotation matrices corresponding to unit time-like split quaternions and homothetic motions. Afterwards we give some examples to illustrate our…