Related papers: Krylov complexity and orthogonal polynomials
We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…
Bilevel optimization, with broad applications in machine learning, has an intricate hierarchical structure. Gradient-based methods have emerged as a common approach to large-scale bilevel problems. However, the computation of the…
Mixed-effects models are widely used to model data with hierarchical grouping structures and high-cardinality categorical predictor variables. However, for high-dimensional crossed random effects, current standard computations relying on…
In this study, we analyze Krylov Complexity in two-dimensional conformal field theories subjected to deformed SL$(2,\mathbb{R})$ Hamiltonians. In the vacuum state, we find that the K-complexity exhibits a universal phase structure. The…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
Inspired by the universal operator growth hypothesis, we extend the formalism of Krylov construction in dissipative open quantum systems connected to a Markovian bath. Our construction is based upon the modification of the Liouvillian…
We calculate Nielsen's circuit complexity of coherent spin state operators. An expression for the complexity is obtained by using the small angle approximation of the Euler angle parametrisation of a general $SO(3)$ rotation. This is then…
We investigate and characterize the dynamics of operator growth in irrational two-dimensional conformal field theories. By employing the oscillator realization of the Virasoro algebra and CFT states, we systematically implement the Lanczos…
We provide convergence rates for Krylov subspace solutions to the trust-region and cubic-regularized (nonconvex) quadratic problems. Such solutions may be efficiently computed by the Lanczos method and have long been used in practice. We…
We study a family of orthogonal polynomials which satisfy (apart from a 3-term recurrence relation) an eigenvalue equation involving a third order differential operator of Dunkl-type. The orthogonality measure of these polynomials consists…
An a posteriori estimate for the error of a standard Krylov approximation to the matrix exponential is derived. The estimate is based on the defect (residual) of the Krylov approximation and is proven to constitute a rigorous upper bound on…
Making use of the modern techniques of non-holonomic geometry and constrained variational calculus, a revisitation of Ostrogradsky's Hamiltonian formulation of the evolution equations determined by a Lagrangian of order >= 2 in the…
We investigate the Krylov complexity of thermofield double states in systems with mixed phase space, uncovering a direct correlation with the Brody distribution, which interpolates between Poisson and Wigner statistics. Our analysis spans…
This paper is devoted to characterizations classical orthogonal polynomials on quadratic lattices by using a matrix approach. In this form we recover the Hahn, Geronimus, Tricomi and Bochner type characterizations of classical orthogonal…
The paper is concerned with methods for computing the best low multilinear rank approximation of large and sparse tensors. Krylov-type methods have been used for this problem; here block versions are introduced. For the computation of…
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of…
This work introduces a novel algorithm to solve large-scale eigenvalue problems and seek a small set of eigenpairs. The method, called randomized Krylov-Schur (rKS), has a simple implementation and benefits from fast and efficient…
An explicit expression for the general bivariate Krawtchouk polynomials is obtained in terms of the standard Krawtchouk and dual Hahn polynomials. The bivariate Krawtchouk polynomials occur as matrix elements of the unitary reducible…
New sequences of orthogonal polynomials with respect to the weight functions $e^{-x} \rho_\nu(x),\ e^{- 1/x} x^{-1} \rho_{\nu} (x), \rho_{\nu}(x)= 2 x^{\nu/2} K_\nu(2\sqrt x),\ x >0, \nu \in \mathbb{R}$, where $K_\nu(z)$ is the modified…
In this article, we will explore why Karlin-McGregor method of using orthogonal polynomials in the study of Markov processes was so successful for one dimensional nearest neighbor processes, but failed beyond nearest neighbor transitions.…