Accurate solution of polynomial equations using Macaulay resultant matrices

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Computational aspects of higher-dimensional varieties (14Q15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Polynomials, factorization in commutative rings (13P05)

Related Items

A numerical elimination method for polynomial computations, A fast recursive orthogonalization scheme for the Macaulay matrix, Multidimensional realisation theory and polynomial system solving, Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values, Regularization and Matrix Computation in Numerical Polynomial Algebra, Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), Nonlinear approximation of functions in two dimensions by sums of exponential functions, Explicit determinantal representations of up to quintic bivariate polynomials, Numerical Instability of Resultant Methods for Multidimensional Rootfinding, Modeling three-dimensional surface-to-surface rigid contact and impact, Roots of Bivariate Polynomial Systems via Determinantal Representations, Computing the common zeros of two bivariate functions via Bézout resultants, Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition, Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition, An eigen-representation of the Navier-Stokes equations

Uses Software

Cites Work