Structured matrix based methods for approximate polynomial GCD

DOI10.1007/978-88-7642-381-9MaRDI QIDQ3087160zbMATH OpenOpenAlexFDO

Authors Paola Boito

Publication date 2 August 2011

Full work available at URL https://doi.org/10.1007/978-88-7642-381-9

zbMATH Keywords

Approximated greatest common divisorBezout matrixEuclidean algorithmGreatest common divisorHouseholder tridiagonalizationPolynomialQR decompositionSylvester matrix

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization of matrices (15A23) Toeplitz, Cauchy, and related matrices (15B05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)

Recommendations

• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• Approximate polynomial GCD.
• Structured low rank approximation of a Bezout matrix
• Numerical and symbolical methods for the GCD of several polynomials
• scientific article; zbMATH DE number 5168246

Cited in

(31)

• Quasi-gcd computations
• An extended polynomial GCD algorithm using Hankel matrices
• Structured matrix methods computing the greatest common divisor of polynomials
• The Sylvester and Bézout resultant matrices for blind image deconvolution
• Toward the best algorithm for approximate GCD of univariate polynomials
• Approximate polynomial GCD by approximate syzygies
• Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
• Approximate square-free part and decomposition
• The generalized Schur algorithm and some applications
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• Structured total least norm and approximate GCDs of inexact polynomials
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Extended companion matrix for approximate GCD
• A subresultant based subspace method for the computation of polynomial GCDs
• Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
• Numerical and symbolical methods for the GCD of several polynomials
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• Approximate polynomial GCD.
• scientific article; zbMATH DE number 1253994 (Why is no real title available?)
• scientific article; zbMATH DE number 1262453 (Why is no real title available?)
• The GPGCD algorithm with the Bézout matrix
• Approximate greatest common divisor of several polynomials from Hankel matrices
• Structured matrix-based methods for polynomial -gcd: analysis and comparisons
• The RKFIT algorithm for nonlinear rational approximation
• Validated Root Enclosures for Interval Polynomials with Multiplicities
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
• Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
• Preliminary orbits with overdetermined systems of Keplerian conservation laws
• Blind image deconvolution through Bezoutians
• Relaxed NewtonSLRA for approximate GCD

Describes a project that uses

Uses Software

• Matlab
• MultRoot

This page was built for publication: Structured matrix based methods for approximate polynomial GCD

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