An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix

DOI10.1016/j.cam.2012.07.023zbMath1253.65065OpenAlexW1995730443MaRDI 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

zbMATH Keywords

algorithmnumerical examplesSylvester resultant matrixstructured low rank approximation

Mathematics Subject Classification ID

Related Items (13)

Polynomial computations for blind image deconvolution ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ 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 ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ The computation of multiple roots of a polynomial ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ 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 ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ Variable projection methods for approximate (greatest) common divisor computations

This page was built for publication: An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix