Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle

DOI10.1016/j.cam.2014.02.017zbMath1293.65065OpenAlexW2023259638MaRDI QIDQ396051

Marc Van Barel, Matthias Humet

Publication date: 8 August 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.02.017

zbMATH Keywords

orthogonal polynomialssemiseparable matricesGeronimus transformationQR stepRQ factorizationunitary Hessenberg matrices

Mathematics Subject Classification ID

Factorization of matrices (15A23) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Orthogonalization in numerical linear algebra (65F25)

Related Items (3)

Darboux transformations for CMV matrices ⋮ The Kähler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks ⋮ Zeros of para-orthogonal polynomials and linear spectral transformations on the unit circle

Uses Software

• OPQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculation of Gauss quadratures with multiple free and fixed knots
• When is the Uvarov transformation positive definite?
• Spectral transformations for Hermitian Toeplitz matrices
• Rational \(QR\)-iteration without inversion
• Implicit double shift \(QR\)-algorithm for companion matrices
• Orthogonal polynomials and measures on the unit circle. The geronimus transformations
• On the calculation of Jacobi matrices
• The QR algorithm for unitary Hessenberg matrices
• Jacobi matrices for measures modified by a rational factor
• The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
• Direct and inverse polynomial perturbations of Hermitian linear functionals
• A more accurate algorithm for computing the Christoffel transformation
• Christoffel transforms and Hermitian linear functionals
• Some Perspectives on the Eigenvalue Problem
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
• Moment Theory, Orthogonal Polynomials, Quadrature, and Continued Fractions Associated with the unit Circle
• Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials
• Algebraic Methods for Modified Orthogonal Polynomials
• The Relation Between the QR and LR Algorithms
• Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
• The QR Algorithm Revisited
• On computing givens rotations reliably and efficiently
• An Error Analysis of a Unitary Hessenberg QR Algorithm
• An Implemention of Christoffel's Theorem in the Theory of Orthogonal Polynomials

This page was built for publication: Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle