A structured rank-revealing method for Sylvester matrix
DOI10.1016/J.CAM.2007.01.032zbMATH Open1140.65035OpenAlexW2151260004MaRDI QIDQ2469622FDOQ2469622
Authors: Bingyu Li, Lihong Zhi, Zhuojun Liu 
Publication date: 6 February 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.01.032
Recommendations
- Implementation of fast low rank approximation of a Sylvester matrix
- On rank and null space computation of the generalized Sylvester matrix
- A fast algorithm for the inverse of Sylvester matrices
- The generalized Schur algorithm and some applications
- Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)
Cholesky factorizationnumerical examplesSylvester matrixnumerical rankdisplacement structuregeneralized Schur algorithmrank-revealing algorithm
Complexity and performance of numerical algorithms (65Y20) Hermitian, skew-Hermitian, and related matrices (15B57) Symbolic computation and algebraic computation (68W30) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Matrix Analysis
- Displacement Structure: Theory and Applications
- Certified approximate univariate GCDs
- Title not available (Why is that?)
- Title not available (Why is that?)
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Title not available (Why is that?)
- Cholesky factorization of semidefinite Toeplitz matrices
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- Title not available (Why is that?)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- On eigenvalues of a Rayleigh quotient matrix
- Stabilizing the Generalized Schur Algorithm
- A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
- Title not available (Why is that?)
Cited In (15)
- Polynomial greatest common divisor as a solution of system of linear equations
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Title not available (Why is that?)
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
- Computing the polynomial remainder sequence via Bézout matrices
- A fast algorithm for the inverse of Sylvester matrices
- A numerical characteristic of the Sylvester matrix
- On the computation of the rank of block bidiagonal Toeplitz matrices
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- The numerical rank of Krylov matrices
- A note on the inversion of Sylvester matrices in control systems
- Implementation of fast low rank approximation of a Sylvester matrix
- A new method of calculating the rank of the matrix.
- The generalized Schur algorithm and some applications
- On rank and null space computation of the generalized Sylvester matrix
Uses Software
This page was built for publication: A structured rank-revealing method for Sylvester matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469622)
