Accurate solution of polynomial equations using Macaulay resultant matrices
DOI10.1090/S0025-5718-04-01722-3zbMATH Open1083.65052MaRDI QIDQ4821046FDOQ4821046
Authors: Gudbjorn F. Jonsson, Stephen A. Vavasis 
Publication date: 7 October 2004
Published in: Mathematics of Computation (Search for Journal in Brave)
Recommendations
- Foreword. What is numerical algebraic geometry?
- Algorithms in real algebraic geometry
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Solving polynomial equations. Foundations, algorithms, and applications
- Efficient solution of real polynomial systems of equations
- Introduction to numerical algebraic geometry
- scientific article; zbMATH DE number 1263362
- scientific article; zbMATH DE number 1276817
- scientific article; zbMATH DE number 1023365
algorithmerror boundnumerical analysisbackward stabilitynumerical algebraic geometrysystems of polynomial equationsnumerical polynomial algebra
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials, factorization in commutative rings (13P05) Real polynomials: location of zeros (26C10) Computational aspects of higher-dimensional varieties (14Q15)
Cites Work
- Algorithm 777: HOMPACK90
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharp estimates for the arithmetic Nullstellensatz
- Solving Polynomials with Small Leading Coefficients
- Title not available (Why is that?)
- Multivariate polynomials, duality, and structured matrices
- Total Least Norm Formulation and Solution for Structured Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Polynomial Roots from Companion Matrix Eigenvalues
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for intersecting parametric and algebraic curves I
- Solving algebraic systems using matrix computations
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Matrices in elimination theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resultant over the residual of a complete intersection.
- Multivariate subresultants
- Quality Mesh Generation in Higher Dimensions
Cited In (17)
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Explicit determinantal representations of up to quintic bivariate polynomials
- Modeling three-dimensional surface-to-surface rigid contact and impact
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Computing the common zeros of two bivariate functions via Bézout resultants
- Regularization and matrix computation in numerical polynomial algebra
- Multidimensional realisation theory and polynomial system solving
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- A numerical approach to the solution of stable resultant linear systems
- An eigen-representation of the Navier-Stokes equations
- Numerical instability of resultant methods for multidimensional rootfinding
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- A numerical elimination method for polynomial computations
- Nonlinear approximation of functions in two dimensions by sums of exponential functions
- Roots of bivariate polynomial systems via determinantal representations
- Accelerated Solution of Multivariate Polynomial Systems of Equations
Uses Software
This page was built for publication: Accurate solution of polynomial equations using Macaulay resultant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4821046)
