Stability Issues in the Factorization of Structured Matrices
From MaRDI portal
Recommendations
Cited in
(18)- A hybrid method for computing the intersection and tangency points of plane curves
- Fast robust regression algorithms for problems with Toeplitz structure
- Sensitivity analysis for Szegő polynomials
- scientific article; zbMATH DE number 1618011 (Why is no real title available?)
- 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
- A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
- A fast algorithm for subspace state-space system identification via exploitation of the displacement structure
- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- Stability analysis of block factorization for complex symmetric block tridiagonal matrices
- High performance algorithms for Toeplitz and block Toeplitz matrices
- On a class of matrices with low displacement rank
- Cholesky factorization of semidefinite Toeplitz matrices
- A numerically stable, finite memory, fast array recursive least squares filter for broadband active noise control
- scientific article; zbMATH DE number 3860292 (Why is no real title available?)
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- Efficient implementation of a structured total least squares based speech compression method
- The generalized Schur algorithm and some applications
This page was built for publication: Stability Issues in the Factorization of Structured Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3126191)