On rank and null space computation of the generalized Sylvester matrix
From MaRDI portal
Publication:5962121
DOI10.1007/s11075-009-9336-6zbMath1198.65082MaRDI QIDQ5962121
Dimitrios Triantafyllou, Marilena Mitrouli
Publication date: 16 September 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9336-6
numerical examples; Toeplitz matrix; rank; symbolic computations; null space; generalized Sylvester matrix; low-rank displacement methods; LU and QR factorization algorithms
68W30: Symbolic computation and algebraic computation
65F05: Direct numerical methods for linear systems and matrix inversion
15A03: Vector spaces, linear dependence, rank, lineability
15B05: Toeplitz, Cauchy, and related matrices
Related Items
Blind image deconvolution using a banded matrix method, Parallel QR processing of generalized Sylvester matrices, A hybrid method for computing the intersection and tangency points of plane curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rang revealing QR factorizations
- Rank and null space calculations using matrix decomposition without column interchanges
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- Normal factorisation of polynomials and computational issues.
- Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
- A new source of structured singular value decomposition problems
- A structured rank-revealing method for Sylvester matrix
- Partial singular value decomposition algorithm
- Greatest common divisors from generalized sylvester resultant matrices
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Comparison of algorithms for calculation of g.c.d. of polynomials
- A minimization algorithm for the design of linear multivariable systems
- Numerical Analysis and Its Applications
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
