On reduced polynomial-based split algorithms
type: Item
instance of: scholarly article
title: On reduced polynomial-based split algorithms
zbMATH Open document ID: 0803.65051
DOI: 10.1007/BF01187546
author: Hari Krishna
published in: Circuits, Systems, and Signal Processing
publication date: 1995-01-02T00:00:00Z
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 554120
zbMATH Keywords: Levinson-Durbin algorithm
zbMATH Keywords: Schur algorithm
zbMATH Keywords: three-term recurrence relation
zbMATH Keywords: lattice algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: split algorithms
zbMATH Keywords: Toeplitz matrices
MaRDI profile type: Publication
cites work: The Fitting of Time-Series Models
cites work: Q3830387
cites work: A fixed point computation of partial correlation coefficients
cites work: The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
cites work: An inverse problem for Toeplitz matrices and the synthesis of discrete transmission lines
cites work: Some matrix factorization identities for discrete inverse scattering
cites work: An inverse problem for Toeplitz matrices
cites work: Immittance-domain Levinson algorithms
cites work: Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
cites work: The One-Dimensional Inverse Problem of Reflection Seismology
description: scientific article; zbMATH DE number 554120