scientific article; zbMATH DE number 1254251

Stephen M. Watt, Robert M. Corless, Patrizia Gianni, Barry M. Trager

Publication date: 19 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

polynomial computations Lazard's \(u\)-resultant algorithm overdetermined systems of polynomial equations singular value decomposition algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Real polynomials: location of zeros (26C10)

Related Items

Structured low rank approximation, Polynomial computations for blind image deconvolution, Pseudozeros of multivariate polynomials, Numerical and Symbolical Methods for the GCD of Several Polynomials, Certified approximate univariate GCDs, The amended DSeSC power method for polynomial root-finding, The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials, Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs, Bernstein-Bézoutian matrices, Parametrization of approximate algebraic curves by lines, Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction, Pseudospectra of exponential matrix polynomials, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, On rational functions without Froissart doublets, The calculation of the degree of an approximate greatest common divisor of two polynomials, A fast recursive orthogonalization scheme for the Macaulay matrix, Validated Root Enclosures for Interval Polynomials with Multiplicities, An ODE-based method for computing the approximate greatest common divisor of polynomials, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Obtaining exact interpolation multivariate polynomial by approximation, Approximate parametrization of plane algebraic curves by linear systems of curves, The computation of multiple roots of a polynomial, A geometrical approach to finding multivariate approximate LCMs and GCDs, A subdivision method for computing nearest gcd with certification, Guessing singular dependencies, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain, Root-finding by expansion with independent constraints, Obtaining exact value by approximate computations, Recursive polynomial remainder sequence and its subresultants, The computation of the degree of the greatest common divisor of three Bernstein basis polynomials, Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation, Symbolic-numeric sparse interpolation of multivariate polynomials, Computing multiple roots of inexact polynomials, Rational Hausdorff divisors: a new approach to the approximate parametrization of curves, Regularization and Matrix Computation in Numerical Polynomial Algebra, Structured total least norm and approximate GCDs of inexact polynomials, Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials, The ERES method for computing the approximate GCD of several polynomials, Approximate polynomial GCD by approximate syzygies, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials, New progress in real and complex polynomial root-finding, A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix, Distance bounds of \(\varepsilon\)-points on hypersurfaces, The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain, Using symmetries in the eigenvalue method for polynomial systems, Algebraic properties of robust Padé approximants, A computational study of ruled surfaces, The Computation of Multiple Roots of a Bernstein Basis Polynomial, Nearest multivariate system with given root multiplicities, Computing approximate greatest common right divisors of differential polynomials, On real factors of real interval polynomials, A robust solution of the generalized polynomial Bézout identity, An algorithm for computing certified approximate GCD of \(n\) univariate polynomials, Parametrization of approximate algebraic surfaces by lines, Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases, Computation of approximate polynomial GCDs and an extension, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility, Variable projection methods for approximate (greatest) common divisor computations

Uses Software

LAPACK