Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
From MaRDI portal
(Redirected from Publication:3603591)
Recommendations
- Block \(LU\) factorizations of \(M\)-matrices
- Computing the block factorization of complex Hankel matrices
- Block LU-factorization of confluent Vandermonde matrices
- Block diagonalization and LU-equivalence of Hankel matrices
- scientific article; zbMATH DE number 2193322
- The Gauss-Huard algorithm and LU factorization
- Factorization of block matrices
- Factorizations of Hermitian block Hankel matrices
- Stability of block LU factorization for block tridiagonal block H-matrices
- Block incomplete LU factorization for block-tridiagonal M-matrices
Cites work
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- Algebraic methods for Toeplitz-like matrices and operators
- Algorithms in real algebraic geometry
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
- Block diagonalization and LU-equivalence of Hankel matrices
- Computationally efficient applications of the Euclidean algorithm to zero location
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- On the partial realization problem
- Sylvester-Habicht sequences and fast Cauchy index computation
Cited in
(6)- Block LU-factorization of confluent Vandermonde matrices
- Computing the block factorization of complex Hankel matrices
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Euclidean Algorithm and Hankel Matrices
- Computing the polynomial remainder sequence via Bézout matrices
- Block diagonalization and LU-equivalence of Hankel matrices
This page was built for publication: Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603591)
