Publication:4227296
From MaRDI portal
zbMath0920.65034MaRDI QIDQ4227296
Patrizia Gianni, Robert M. Corless, Stephen M. Watt, Barry M. Trager
Publication date: 19 September 1999
polynomial computations; Lazard's \(u\)-resultant algorithm; overdetermined systems of polynomial equations; singular value decomposition algorithms
68W30: Symbolic computation and algebraic computation
65H10: Numerical computation of solutions to systems of equations
26C10: Real polynomials: location of zeros
Related Items
Computing multiple roots of inexact polynomials, Pseudozeros of multivariate polynomials, Symbolic-numeric sparse interpolation of multivariate polynomials, New progress in real and complex polynomial root-finding, Bernstein-Bézoutian matrices, Parametrization of approximate algebraic curves by lines, The calculation of the degree of an approximate greatest common divisor of two polynomials, Approximate parametrization of plane algebraic curves by linear systems of curves, A subdivision method for computing nearest gcd with certification, Using symmetries in the eigenvalue method for polynomial systems, Recursive polynomial remainder sequence and its subresultants, The ERES method for computing the approximate GCD of several polynomials, A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix, A computational study of ruled surfaces, Nearest multivariate system with given root multiplicities, On real factors of real interval polynomials, An algorithm for computing certified approximate GCD of \(n\) univariate polynomials, Certified approximate univariate GCDs, A robust solution of the generalized polynomial Bézout identity, Computation of approximate polynomial GCDs and an extension, Structured low rank approximation, The amended DSeSC power method for polynomial root-finding, Obtaining exact value by approximate computations, Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation, Structured total least norm and approximate GCDs of inexact polynomials, Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), Distance bounds of \(\varepsilon\)-points on hypersurfaces, Parametrization of approximate algebraic surfaces by lines, Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases, Regularization and Matrix Computation in Numerical Polynomial Algebra, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
Uses Software
