Related papers: On the convergence of complex Jacobi methods
Extending earlier work of Killip-Simon and Simon-Zlatos, we obtain sum rules for Jacobi matrices in which the a.c. part of the spectral measure and the eigenvalues of the matrix appear on opposite sides of the equation. We use these to…
We use the classical results of Baxter and Gollinski-Ibragimov to prove a new spectral equivalence for Jacobi matrices on $l^2(\N)$. In particular, we consider the class of Jacobi matrices with conditionally summable parameter sequences and…
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…
This paper introduces an innovative method for ensuring global stability in a broad array of nonlinear systems. The novel approach enhances the traditional analysis based on Jacobian matrices by incorporating the Taylor series boundary…
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
We calculate the $k$-point generating function of the correlated Jacobi ensemble using supersymmetric methods. We use the result for complex matrices for $k=1$ to derive a closed-form expression for eigenvalue density. For real matrices we…
We study the Lanczos algorithm where the initial vector is sampled uniformly from $\mathbb{S}^{n-1}$. Let $A$ be an $n \times n$ Hermitian matrix. We show that when run for few iterations, the output of Lanczos on $A$ is almost…
In this paper, we study the gap probability problem of the (symmetric) Jacobi unitary ensemble of Hermitian random matrices, namely the probability that the interval $(-a,a)\:(0<a<1)$ is free of eigenvalues. Using the ladder operator…
We prove for general paramodular level that formal series of scalar Jacobi forms with an involution condition necessarily converge and are therefore the Fourier-Jacobi expansions at the standard 1-cusp of paramodular Fricke eigenforms.
In this work we present a formal generalization of the Hamilton-Jacobi formalism, recently developed for singular systems, to include the case of Lagrangians containing variables which are elements of Berezin algebra. We derive the…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
We compute the subgroup of the monodromy group of a generalized Kummer variety associated to equivalences of derived categories of abelian surfaces. The result was previously announced in arXiv:1201.0031. Mongardi showed that the subgroup…
We prove a sharp Lieb-Thirring type inequality for Jacobi matrices, thereby settling a conjecture of Hundertmark and Simon. An interesting feature of the proof is that it employs a technique originally used by Hundertmark-Laptev-Weidl…
Many optimization problems require balancing multiple conflicting objectives. As gradient descent is limited to single-objective optimization, we introduce its direct generalization: Jacobian descent (JD). This algorithm iteratively updates…
We give a new method to prove in a uniform and easy way various transformation formulas for Gauss hypergeometric functions. The key is Jacobi's canonical form of the hypergeometric differential equation. Analogy for $q$-hypergeometric…
We associate a Jacobi form over a rank s lattice to N=2, D=4 heterotic string compactifications which have s Wilson lines at a generic point in the vector multiplet moduli space. Jacobi forms of index m=1 and m=2 have appeared earlier in…
A complete characterization is provided of Hankel matrices commuting with Jacobi matrices which correspond to hypergeometric orthogonal polynomials from the Askey scheme. It follows, as the main result of the paper, that the generalized…
We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^{-1}$ when $A$ is invertible, which may be traced back to…
We consider the conjugate gradient algorithm applied to a general class of spiked sample covariance matrices. The main result of the paper is that the norms of the error and residual vectors at any finite step concentrate on deterministic…
We prove explicit estimates for the error in random homogenization of degenerate, second-order Hamilton-Jacobi equations, assuming the coefficients satisfy a finite range of dependence. In particular, we obtain an algebraic rate of…