Related papers: Solution of Matrix Dyson Equation for Random Matri…
We consider the action of a pseudo-Anosov mapping class on $\mathcal{PML}(S)$. This action has north-south dynamics and so, under iteration, laminations converge exponentially to the stable lamination. We study the rate of this convergence…
The time-marching strategy, which propagates the solution from one time step to the next, is a natural strategy for solving time-dependent differential equations on classical computers, as well as for solving the Hamiltonian simulation…
In this paper we investigate the existence of a solution to the Poisson equation on complete manifolds with positive spectrum and Ricci curvature bounded from below. We show that if a function $f$ has decay $f=O(r^{-1-\varepsilon}) $ for…
We give a stochastic optimization algorithm that solves a dense $n\times n$ real-valued linear system $Ax=b$, returning $\tilde x$ such that $\|A\tilde x-b\|\leq \epsilon\|b\|$ in time: $$\tilde O((n^2+nk^{\omega-1})\log1/\epsilon),$$ where…
In this paper, we propose a randomized accelerated method for the minimization of a strongly convex function under linear constraints. The method is of Kaczmarz-type, i.e. it only uses a single linear equation in each iteration. To obtain…
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes…
We propose and demonstrate a method for measuring the time evolution of the off-diagonal elements $\rho_{n,n+k}(t)$ of the reduced density matrix obtained from the quantum theory of the laser. The decay rates of the off-diagonal matrix…
In this work we apply the Adomian decomposition method combined with the Laplace transform (LADM) in order to solve the 1-dimensional nonlinear Schrodinger equation whose nonlinear term presents a nonlinear defocusing strength that varies…
Given the ground state wavefunction for an interacting lattice model, we define a "correlation density matrix"(CDM) for two disjoint, separated clusters $A$ and $B$, to be the density matrix of their union, minus the direct product of their…
It is a result of Ginibre that the normalized bulk $k$-point correlation functions of a complex $n\times n$ Gaussian matrix with independent entries of mean zero and unit variance are asymptotically given by the determinantal point process…
The classical 1961 solution to the problem of determining the number of perfect matchings (or dimer coverings) of a rectangular grid graph -- due independently to Kasteleyn and to Temperley and Fisher -- consists of changing the sign of…
We have obtained all the density matrix elements on six lattice sites for the spin-1/2 Heisenberg chain via the algebraic method based on the quantum Knizhnik-Zamolodchikov equations. Several interesting correlation functions, such as…
The first work of Dyson relating to random matrix theory, "The dynamics of a disordered linear chain", is reviewed. Contained in this work is an exact solution of a so-called Type I chain in the case of the disorder variables being given by…
Theoretical predictions for B decay rates are rewritten in terms of the Upsilon meson mass instead of the b quark mass, using a modified perturbation expansion. The theoretical consistency is shown both at low and high orders. This method…
We develop a fast and robust algorithm for solving large scale convex composite optimization models with an emphasis on the $\ell_1$-regularized least squares regression (Lasso) problems. Despite the fact that there exist a large number of…
We consider effective versions of two classical theorems, the Lebesgue density theorem and the Denjoy-Young-Saks theorem. For the first, we show that a Martin-Loef random real $z\in [0,1]$ is Turing incomplete if and only if every…
This paper studies matrix constrained polynomial optimization. We investigate how to get explicit expressions for Lagrange multiplier matrices from the first order optimality conditions. The existence of these expressions can be shown under…
A theorem of N. Katz \cite{Ka} p.45, states that an irreducible differential operator $L$ over a suitable differential field $k$, which has an isotypical decomposition over the algebraic closure of $k$, is a tensor product $L=M\otimes_k N$…
Nonlinear least-squares problems are a special class of unconstrained optimization problems in which their gradient and Hessian have special structures. In this paper, we exploit these structures and proposed a matrix-free algorithm with a…
We consider a variant of inexact Newton Method, called Newton-MR, in which the least-squares sub-problems are solved approximately using Minimum Residual method. By construction, Newton-MR can be readily applied for unconstrained…