Block Krylov subspaces and orthogonal matrix polynomials: a structural correspondence with applications to unitary matrices
For researchers in numerical linear algebra and matrix computations, this provides a unified theoretical framework and practical algorithms for block Krylov methods, particularly for unitary matrices.
The paper establishes an isometric isomorphism between block Krylov subspaces and spaces of matrix polynomials, extending classical results to normal matrices and unitary matrices. This yields efficient orthogonalization procedures for polynomial and extended block Krylov subspaces via Szegő recurrence and CMV framework.
We study the connection between block Krylov subspaces and matrix orthogonal functions. Under a no-deflation assumption, we show that polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree, providing a unified framework for the analysis and construction of orthonormal bases and recurrence relations. The same correspondence holds for rational block Krylov subspaces and matrix-valued rational functions, and in the extended Krylov setting this leads naturally to Laurent matrix polynomials. When the matrix $A$ is normal, we prove that the induced inner product admits a representation in terms of a discrete spectral matrix measure, extending a classical result for Hermitian matrices. In the unitary case, where the measure is supported on the unit circle, this connection allows us to transfer the Szegő recurrence for orthogonal matrix polynomials and the CMV framework for Laurent matrix polynomials to the block Krylov setting, yielding efficient procedures for the orthogonalization of polynomial and extended block Krylov subspaces.