On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms

Authors:
A. W. Bojanczyk;R. P. Brent;F. R. de Hoog;D. R. Sweet
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1995

Citing 0
Cited 5

On the Stability of the Generalized Schur Algorithm

NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
An Efficient Parallel Algorithm to Solve Block-Toeplitz Systems

The Journal of Supercomputing
Pivoting for structured matrices and rational tangential interpolation

Contemporary mathematics
A structured rank-revealing method for Sylvester matrix

Journal of Computational and Applied Mathematics
Stability of the Levinson Algorithm for Toeplitz-Like Systems

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let $A$ be a $k \by n$ underdetermined matrix. The sparse basis problem for the row space $W$ of $A$ is to find a basis of $W$ with the fewest number of nonzeros. Suppose that all the entries of $A$ are nonzero, and that they are algebraically independent ...