Accurate solution of polynomial equations using Macaulay resultant matrices
From MaRDI portal
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)
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
Cites work
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 3561264 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1015397 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 3001304 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Algorithm 777: HOMPACK90
- Algorithms for intersecting parametric and algebraic curves I
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Matrices in elimination theory
- Multivariate polynomials, duality, and structured matrices
- Multivariate subresultants
- Polynomial Roots from Companion Matrix Eigenvalues
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Quality Mesh Generation in Higher Dimensions
- Resultant over the residual of a complete intersection.
- Sharp estimates for the arithmetic Nullstellensatz
- Solving Polynomials with Small Leading Coefficients
- Solving algebraic systems using matrix computations
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Total Least Norm Formulation and Solution for Structured Problems
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)
- Modeling three-dimensional surface-to-surface rigid contact and impact
- Explicit determinantal representations of up to quintic bivariate polynomials
- 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
- A numerical approach to the solution of stable resultant linear systems
- 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
- 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
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)
