A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

DOI10.1016/j.cam.2010.04.013zbMath1196.65083OpenAlexW2018906756MaRDI QIDQ989131

Madina Hasan, Winkler, Joab R.

Publication date: 27 August 2010

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.2010.04.013

zbMATH Keywords

numerical examplesSylvester resultant matrixstructured low rank approximationinexact polynomialsnon-linear structure preserving matrix method

Mathematics Subject Classification ID

Related Items (11)

Polynomial computations for blind image deconvolution ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein 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 ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ Real polynomial root-finding by means of matrix and polynomial iterations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic geometry and computer vision: Polynomial systems, real and complex roots
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• Computation of approximate polynomial GCDs and an extension
• Structured total least norm and approximate GCDs of inexact polynomials
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Polynomial Scaling
• Structured Total Least Norm for Nonlinear Problems
• Total Least Norm Formulation and Solution for Structured Problems
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials

This page was built for publication: A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix