Formal orthogonal polynomials and Hankel/Toeplitz duality
type: Item
instance of: scholarly article
title: Formal orthogonal polynomials and Hankel/Toeplitz duality
zbMATH Open document ID: 0867.42012
DOI: 10.1007/BF02140773
author: Adhemar Bultheel
author: Marc van Barel
published in: Numerical Algorithms
publication date: 1997-07-13T00:00:00Z
review text: For classical polynomials orthogonal with respect to a positive measure supported on the real line, the moment matrix has a Hankel structure and is positive definite. The polynomials satisfy a three-term recurrence relation and a Christoffel-Darboux type formula. When, as in the Szegö theory, the measure is supported on the complex unit circle, then the moment matrix has a Toeplitz structure, and is strongly regular and positive definite. These Szegö polynomials also satisfy a three-term recurrence relation, but also a coupled recurrence relation. In this interesting paper, the authors study the generalization for formal polynomials orthogonal with respect to an arbitrary moment matrix and consider arbitrary Hankel and Toeplitz matrices as special cases. They show how much of the classical theory of Hankel and Toeplitz matrices can be generalized. A new relation between Schur complements and the Euclidean algorithm is obtained. The relations with Padé approximation, continued fractions and Krylov subspace methods in linear algebra are also outlined.
Mathematics Subject Classification ID: 42C05
zbMATH DE Number: 826914
zbMATH Keywords: orthogonal polynomials
zbMATH Keywords: Hankel matrix
zbMATH Keywords: Toeplitz matrix
zbMATH Keywords: three-term recurrence relation
zbMATH Keywords: Christoffel-Darboux type formula
zbMATH Keywords: Schur complements
zbMATH Keywords: Euclidean algorithm
reviewed by: Luigi Gatteschi
MaRDI profile type: Publication
cites work: Q3974761
cites work: Padé-type approximation and general orthogonal polynomials
cites work: Q4003133
cites work: A unified approach to various orthogonalities
cites work: Q4764025
cites work: Division algorithms for continued fractions and the Padé table
cites work: Q4880404
cites work: Vector Orthogonal Polynomials and Least Squares Approximation
cites work: Q3361791
cites work: Polynômes orthogonaux formels - applications
cites work: Q4016503
cites work: Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
cites work: I. Schur methods in operator theory and signal processing
cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
cites work: Matrix interpretations and applications of the continued fraction algorithm
cites work: The QR algorithm for unitary Hessenberg matrices
cites work: On the partial realization problem
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
cites work: Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
cites work: Algebraic methods for Toeplitz-like matrices and operators
cites work: Displacement ranks of matrices and linear equations
cites work: Reduction to Tridiagonal Form and Minimal Realizations
cites work: Time-variant displacement structure and interpolation problems
cites work: A parallel algorithm for discrete least squares rational approximation
cites work: Discrete linearized least-squares rational approximation on the unit circle
cites work: Orthonormal polynomial vectors and least squares approximation for a discrete inner product
cites work: Vector orthogonal relations. Vector QD-algorithm
cites work: Q5792555
cites work: A GENERAL SYSTEM OF ORTHOGONAL POLYNOMIALS
description: scientific article; zbMATH DE number 826914