Structured total least norm and approximate GCDs of inexact polynomials

DOI10.1016/J.CAM.2007.03.018zbMATH Open1136.65049OpenAlexW2109082865MaRDI QIDQ2480912FDOQ2480912

John D. Allan, Joab R. Winkler

Publication date: 7 April 2008

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

Recommendations

• scientific article
• Structured low rank approximation of a Bezout matrix
• Approximate polynomial GCD.
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• Structured matrix based methods for approximate polynomial GCD

zbMATH Keywords

numerical examplesapproximate greatest common divisorSylvester resultant matrixinexact polynomialsstructured total least norm

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Numerical computation of solutions to single equations (65H05)

Cites Work

• Title not available (Why is that?)
• Computation of approximate polynomial GCDs and an extension
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total Least Norm Formulation and Solution for Structured Problems
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Error Analysis and Implementation Aspects of Deferred Correction for Equality Constrained Least Squares Problems
• A Note on Deferred Correction for Equality Constrained Least Squares Problems

Cited In (15)

• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• A unified approach to resultant matrices for Bernstein basis polynomials
• Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• Computing the polynomial remainder sequence via Bézout matrices
• Variable projection methods for approximate (greatest) common divisor computations
• Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
• Low rank approximation of the symmetric positive semidefinite matrix
• Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
• Approximate least common multiple of several polynomials using the ERES division algorithm
• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value

Uses Software

• MultRoot

This page was built for publication: Structured total least norm and approximate GCDs of inexact polynomials

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