Hybrid algorithm for fast Toeplitz orthogonalization
type: Item
instance of: scholarly article
title: Hybrid algorithm for fast Toeplitz orthogonalization
zbMATH Open document ID: 0629.65031
DOI: 10.1007/BF01404468
author: Sanzheng Qiao
published in: Numerische Mathematik
publication date: 1988-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/133280
review text: New techniques for fast Toeplitz QR decomposition are presented. The methods are based on the shift invariance property of a Toeplitz matrix. The numerical properties of the algorithms are discussed and some comparisons are made with two other fast Toeplitz orthogonalization methods.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65F25
Mathematics Subject Classification ID: 15A23
zbMATH DE Number: 4024622
zbMATH Keywords: fast Toeplitz QR decomposition
zbMATH Keywords: shift invariance
zbMATH Keywords: Toeplitz matrix
zbMATH Keywords: comparisons
zbMATH Keywords: fast Toeplitz orthogonalization methods
zbMATH Keywords: Givens rotation
zbMATH Keywords: Householder transformation
zbMATH Keywords: Cholesky factorization
zbMATH Keywords: least squares problem
MaRDI profile type: Publication
cites work: QR factorization of Toeplitz matrices
cites work: A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
cites work: Fast Toeplitz Orthogonalization Using Inner Products
cites work: Error analysis of QR decompositions by Givens transformations
cites work: Q5185900
cites work: A fast but unstable orthogonal triangularization technique for Toeplitz matrices
cites work: Q4057472
cites work: The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
cites work: Fast Toeplitz orthogonalization
cites work: Q5674306
description: scientific article; zbMATH DE number 4024622