Stabilizing the Generalized Schur Algorithm
From MaRDI portal
Recommendations
Cited in
(17)- Fast robust regression algorithms for problems with Toeplitz structure
- A generalized Schur-type algorithm for the joint factorization of a structured matrix and its inverse
- Look-ahead methods for block Hankel systems
- Efficient implementation of a structured total least squares based speech compression method
- The generalized Schur algorithm and some applications
- A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
- A structured rank-revealing method for Sylvester matrix
- scientific article; zbMATH DE number 1618011 (Why is no real title available?)
- A numerically stable, finite memory, fast array recursive least squares filter for broadband active noise control
- Stability Issues in the Factorization of Structured Matrices
- scientific article; zbMATH DE number 125150 (Why is no real title available?)
- Stable factorization for Hankel and Hankel‐like matrices
- Stable and efficient computation of generalized polar decompositions
- On a class of matrices with low displacement rank
- Infinite quantum signal processing for arbitrary Szegő functions
- On the LU factorization of infinite systems of semi-separable equations
- Fast phase factor finding for quantum signal processing
This page was built for publication: Stabilizing the Generalized Schur Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717301)