Related papers: Computing the Action of Trigonometric and Hyperbol…
Momentum first-order optimization methods are the workhorses in various optimization tasks, e.g., in the training of deep neural networks. Recently, Lucas et al. (2019) proposed a method called Aggregated Heavy-Ball (AggHB) that uses…
The Quantum Singular Value Transformation (QSVT) is a technique that provides a unified framework for describing many of the quantum algorithms discovered to date. We implement a noise-free simulation of the technique to investigate how it…
A new scaling and recovering algorithm is proposed for simultaneously computing the matrix $\varphi$-functions that arise in exponential integrator methods for the numerical solution of certain first-order systems of ordinary differential…
Evaluating multi-center molecular integrals with Cartesian Gaussian-type basis sets has been a long-standing bottleneck in electronic structure theory calculation for solids and molecules. We have developed a vector-coupling and…
Many recent advances in machine learning are driven by a challenging trifecta: large data size $N$; high dimensions; and expensive algorithms. In this setting, cross-validation (CV) serves as an important tool for model assessment. Recent…
This work presents a quantum algorithm for solving linear systems of equations of the form $\mathbf{A}{\frac{\mathbf{\partial f}}{\mathbf{\partial x}}} = \mathbf{B}\mathbf{f}$, based on the Quantum Singular Value Transformation (QSVT). The…
In $L_2(\mathbb{R}^d;\mathbb{C}^n)$ we consider selfadjoint strongly elliptic second order differential operators ${\mathcal A}_\varepsilon$ with periodic coefficients depending on ${\mathbf x}/ \varepsilon$, $\varepsilon>0$. We study the…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
This paper presents novel algorithms which exploit the intrinsic algebraic and combinatorial structure of the matrix completion task for estimating missing en- tries in the general low rank setting. For positive data, we achieve results…
Using the method of C. V\"or\"os, we establish results in hyperbolic plane geometry, related to triangles and circles. We present a model independent construction for Malfatti's problem and several trigonometric formulas for triangles.
We present a procedure for computing the convolution of exponential signals without the need of solving integrals or summations. The procedure requires the resolution of a system of linear equations involving Vandermonde matrices. We apply…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
In this paper, we present a computationally efficient trajectory optimizer that can exploit GPUs to jointly compute trajectories of tens of agents in under a second. At the heart of our optimizer is a novel reformulation of the non-convex…
In electronic structure calculations, the transcorrelated method consists in transforming the Hamiltonian so as to remove the Coulomb cusp in its eigenfunctions. As a result, the wavefunction can be described more accurately without…
Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for…
We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on…
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
We present an efficient algorithm for motion planning and control of a robot system with a high number of degrees-of-freedom. These include high-DOF soft robots or an articulated robot interacting with a deformable environment. Our approach…
Some important applicative problems require the evaluation of functions $\Psi$ of large and sparse and/or \emph{localized} matrices $A$. Popular and interesting techniques for computing $\Psi(A)$ and $\Psi(A)\mathbf{v}$, where $\mathbf{v}$…
Given a semigroup $S$ equipped with an involutive automorphism $\sigma$, we determine the complex-valued solutions $f,g,h$ of the functional equation \begin{equation*}f(x\sigma(y))=f(x)g(y)+g(x)f(y)+h(x)h(y),\,\,x,y\in S,\end{equation*} in…