Structured total least norm and approximate GCDs of inexact polynomials

DOI10.1016/j.cam.2007.03.018zbMath1136.65049OpenAlexW2109082865MaRDI QIDQ2480912

John D. Allan, Winkler, Joab R.

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

zbMATH Keywords

numerical examplesSylvester resultant matrixapproximate greatest common divisorinexact polynomialsstructured total least norm

Mathematics Subject Classification ID

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

Related Items (11)

Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ 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 ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ 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 ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix ⋮ Low rank approximation of the symmetric positive semidefinite matrix ⋮ A unified approach to resultant matrices for Bernstein basis polynomials ⋮ Variable projection methods for approximate (greatest) common divisor computations

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of approximate polynomial GCDs and an extension
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• 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
• 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: Structured total least norm and approximate GCDs of inexact polynomials