Related papers: Accurate complex Jacobi rotations
We construct real Jacobi forms with matrix index using path integrals. The path integral expressions represent elliptic genera of two-dimensional N=(2,2) supersymmetric theories. They arise in a family labeled by two integers N and k which…
We propose two ways for determining the Green's matrix for problems admitting Hamiltonians that have infinite symmetric tridiagonal (i.e. Jacobi) matrix form on some basis representation. In addition to the recurrence relation comming from…
First-order optimization algorithms are widely used today. Two standard building blocks in these algorithms are proximal operators (proximals) and gradients. Although gradients can be computed for a wide array of functions, explicit…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
In this work we develop Curvature Propagation (CP), a general technique for efficiently computing unbiased approximations of the Hessian of any function that is computed using a computational graph. At the cost of roughly two gradient…
The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
Approximate $p$-point Leibniz derivation formulas as well as interpolatory Simpson quadrature sums adapted to oscillatory functions are discussed. Both theoretical considerations and numerical evidence concerning the dependence of the…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…
The main contribution of this paper is twofold: On the one hand, a general framework for performing Hermite interpolation on Riemannian manifolds is presented. The method is applicable, if algorithms for the associated Riemannian…
In this paper, we study the equality constrained nonlinear least squares problem, where the Jacobian matrices of the objective function and constraints are unavailable or expensive to compute. We approximate the Jacobian matrices via…
In this paper, the problem of synthesizing a general Hermitian quantum gate into a set of primary quantum gates is addressed. To this end, an extended version of the Jacobi approach for calculating the eigenvalues of Hermitian matrices in…
The Hamilton-Jacobi equation in the sense of Poincar\'e, i.e. formulated in the extended phase space and including regularization, is revisited building canonical transformations with the purpose of Hamiltonian reduction. We illustrate our…
We propose a fast method for high order approximation of potentials of the Helmholtz type operator Delta+kappa^2 over hyper-rectangles in R^n. By using the basis functions introduced in the theory of approximate approximations, the cubature…
A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function…
The two-body Coulomb Hamiltonian, when calculated in Coulomb-Sturmian basis, has an infinite symmetric tridiagonal form, also known as Jacobi matrix form. This Jacobi matrix structure involves a continued fraction representation for the…
We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchronization. Specifically, we are given directed distances on a…
We describe a suite of fast algorithms for evaluating Jacobi polynomials, applying the corresponding discrete Sturm-Liouville eigentransforms and calculating Gauss-Jacobi quadrature rules. Our approach is based on the well-known fact that…
Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation…