DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
From MaRDI portal
Publication:4445028
DOI10.1142/9789812704436_0024zbMath1092.12003OpenAlexW2137868850MaRDI QIDQ4445028
Publication date: 28 January 2004
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789812704436_0024
Related Items
A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Approximate polynomial GCD over integers ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ A structured rank-revealing method for Sylvester matrix ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ On rank and null space computation of the generalized Sylvester matrix
