Related papers: Conquering the pre-computation in two-dimensional …
We provide efficient constant factor approximation algorithms for the problems of finding a hierarchical clustering of a point set in any metric space, minimizing the sum of minimimum spanning tree lengths within each cluster, and in the…
The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block-encodings…
The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
We develop an efficient numerical method for calculating the image stress field induced by spherical voids in materials. The method is applied to dislocation-void interactions in dislocation dynamics simulations. We obtain a complete set of…
A theory of transformation is presented for the diagonalization of a Hamiltonian that is quadratic in creation and annihilation operators or in coordinates and momenta. It is the systemization and theorization of Dirac and…
Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…
In a dynamical systems description of spatiotemporally chaotic PDEs including those describing turbulence, chaos is viewed as a trajectory evolving within a network of non-chaotic, dynamically unstable, time-invariant solutions embedded in…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
The eigenvalue problem of the spherically symmetric oscillator Hamiltonian is revisited in the context of canonical raising and lowering operators. The Hamiltonian is then factorized in terms of two not mutually adjoint factorizing…
This paper presents a method for the approximation of harmonic potentials that combines downward continuation of globally available data on a sphere $\Omega_R$ of radius $R$ (e.g., a satellite's orbit) with locally available data on a…
We propose a transform for signals defined on the sphere that reveals their localized directional content in the spatio-spectral domain when used in conjunction with an asymmetric window function. We call this transform the directional…
Connection coefficients between different orthonormal bases satisfy two discrete orthogonal relations themselves. For classical orthogonal polynomials whose weights are invariant under the action of the symmetric group, connection…
This paper introduces the hierarchical interpolative factorization for integral equations (HIF-IE) associated with elliptic problems in two and three dimensions. This factorization takes the form of an approximate generalized LU…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
We consider the task of decentralized minimization of the sum of smooth strongly convex functions stored across the nodes of a network. For this problem, lower bounds on the number of gradient computations and the number of communication…
For any undirected graph $G=(V,E)$ and a set $E_W$ of candidate edges with $E\cap E_W=\emptyset$, the $(k,\gamma)$-spectral augmentability problem is to find a set $F$ of $k$ edges from $E_W$ with appropriate weighting, such that the…
We discuss the advantages and limitations of cyclotomic fields to have fast polynomial arithmetic within homomorphic encryption, and show how these limitations can be overcome by replacing cyclotomic fields by a family that we refer to as…
We introduce a new coarse-graining algorithm, tensor network skeletonization, for the numerical computation of tensor networks. This approach utilizes a structure-preserving skeletonization procedure to remove short-range correlations…