An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
From MaRDI portal
Publication:455851
DOI10.1016/j.cam.2012.07.023zbMath1253.65065MaRDI QIDQ455851
Madina Hasan, Winkler, Joab R.
Publication date: 22 October 2012
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.2012.07.023
Related Items
SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Polynomial computations for blind image deconvolution, The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials, The computation of multiple roots of a polynomial, Overdetermined Weierstrass iteration and the nearest consistent system, The calculation of the degree of an approximate greatest common divisor of two polynomials, The Sylvester and Bézout resultant matrices for blind image deconvolution, The computation of the degree of the greatest common divisor of three Bernstein basis polynomials, Structured matrix methods for the computation of multiple roots of a polynomial, Variable projection methods for approximate (greatest) common divisor computations, A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials, A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials, The Sylvester Resultant Matrix and Image Deblurring
