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.023MaRDI QIDQ455851zbMATH OpenOpenAlexFDO

Authors Madina Hasan, Joab R. Winkler

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 examplesstructured low rank approximationSylvester resultant matrix

Mathematics Subject Classification ID

Recommendations

• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• scientific article; zbMATH DE number 5168246
• Structured total least norm and approximate GCDs of inexact polynomials

Cited in

(17)

• 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
• Polynomial computations for blind image deconvolution
• The Sylvester Resultant Matrix and Image Deblurring
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• scientific article; zbMATH DE number 5168246 (Why is no real title available?)
• The computation of multiple roots of a polynomial
• Overdetermined Weierstrass iteration and the nearest consistent system
• Extended Arnoldi methods for large low-rank Sylvester matrix equations
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q455851)