Stability Issues in the Factorization of Structured Matrices
From MaRDI portal
Publication:3126191
DOI10.1137/S089547989528692XzbMath0884.65023MaRDI QIDQ3126191
Michael Stewart, Paul Van Dooren
Publication date: 14 April 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
stabilityerror analysisfactorizationSchur algorithmhyperbolic transformationsToeplitz-based matrices
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Efficient implementation of a structured total least squares based speech compression method, Sensitivity analysis for Szegő polynomials, High performance algorithms for Toeplitz and block Toeplitz matrices, A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix, Cholesky factorization of semidefinite Toeplitz matrices, A hybrid method for computing the intersection and tangency points of plane curves, On a class of matrices with low displacement rank, Fast direct solvers for some complex symmetric block Toeplitz linear systems, A fast algorithm for subspace state-space system identification via exploitation of the displacement structure, An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula, On the computation of the rank of block bidiagonal Toeplitz matrices, The generalized Schur algorithm and some applications, Fast robust regression algorithms for problems with Toeplitz structure, A numerically stable, finite memory, fast array recursive least squares filter for broadband active noise control
