A structured rank-revealing method for Sylvester matrix

DOI10.1016/j.cam.2007.01.032zbMath1140.65035OpenAlexW2151260004MaRDI QIDQ2469622

Bingyu Li, Lihong Zhi, Zhuo-Jun 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

zbMATH Keywords

numerical examplesCholesky factorizationdisplacement structureSylvester matrixnumerical rankgeneralized Schur algorithmrank-revealing algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Hermitian, skew-Hermitian, and related matrices (15B57) Complexity and performance of numerical algorithms (65Y20) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

Computing the polynomial remainder sequence via Bézout matrices, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, 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, On rank and null space computation of the generalized Sylvester matrix, The generalized Schur algorithm and some applications

Uses Software

• MultRoot
• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cholesky factorization of semidefinite Toeplitz matrices
• On eigenvalues of a Rayleigh quotient matrix
• Certified approximate univariate GCDs
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Matrix Analysis
• On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
• A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Stabilizing the Generalized Schur Algorithm
• Displacement Structure: Theory and Applications
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials