Related papers: Lanczos Meets Orthogonal Polynomials
The Lanczos process constructs a sequence of orthonormal vectors v_m spanning a nested sequence of Krylov subspaces generated by a hermitian matrix A and some starting vector b. In this paper we show how to cheaply recover a secondary…
For random matrix ensembles with non-gaussian matrix elements that may exhibit some correlations, it is shown that centered traces of polynomials in the matrix converge in distribution to a Gaussian process whose covariance matrix is…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
In this paper we present a general scheme for how to relate differential equations for the recurrence coefficients of semi-classical orthogonal polynomials to the Painlev\'e equations using the geometric framework of the Okamoto Space of…
We present an overview of randomized orthogonalization techniques that construct a well-conditioned basis whose sketch is orthonormal. Randomized orthogonalization has recently emerged as a powerful paradigm for reducing the computational…
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials…
We analyze randomized matrix-free quadrature algorithms for spectrum and spectral sum approximation. The algorithms studied include the kernel polynomial method and stochastic Lanczos quadrature, two widely used methods for these tasks. Our…
We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…
Polynomial Krylov subspace methods are among the most widely used methods for approximating $f(A)b$, the action of a matrix function on a vector, in particular when $A$ is large and sparse. When $A$ is Hermitian positive definite, the…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
Recently, the out-of-time-ordered correlator(OTOC) and Krylov complexity have been studied actively as a measure of operator growth. OTOC is known to exhibit exponential growth in chaotic systems, which was confirmed in many previous works.…
We discuss the relationship between the recurrence coefficients of orthogonal polynomials with respect to a generalized Freud weight \[w(x;t)=|x|^{2\lambda+1}\exp\left(-x^4+tx^2\right),\qquad x\in\mathbb{R},\] with parameters $\lambda>-1$…
The efficacy of numerical methods like integral estimates via Gaussian quadrature formulas depends on the localization of the zeros of the associated family of orthogonal polynomials. In this regard, following the renewed interest in…
Let $(P_n(x;z;\lambda))_{n\geq 0}$ be the sequence of monic orthogonal polynomials with respect to the symmetric linear functional $\mathbf{s}$ defined by $$\langle\mathbf{s},p\rangle=\int_{-1}^1 p(x)(1-x^2)^{(\lambda-1/2)}…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
We review recent results on necessary and sufficient conditions for measures on $\mathbb{R}$ and $\partial\mathbb{D}$ to yield exponential decay of the recursion coefficients of the corresponding orthogonal polynomials. We include results…