Solving polynomial systems via truncated normal forms
From MaRDI portal
Publication:4689237
Abstract: We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to compute the structure of the quotient ring R/I from the null space of a Macaulay-type matrix. The affine dense, affine sparse, homogeneous and multi-homogeneous cases are treated. In the presented framework, the concept of a border basis is generalized by relaxing the conditions on the set of basis elements. This allows for algorithms to adapt the choice of basis in order to enhance the numerical stability. We present such an algorithm and show numerical results.
Recommendations
Cites work
- scientific article; zbMATH DE number 5082646 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 1263319 (Why is no real title available?)
- scientific article; zbMATH DE number 578220 (Why is no real title available?)
- scientific article; zbMATH DE number 1504686 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 2196434 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- A Poisson formula for the sparse resultant
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A criterion for detecting m-regularity
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A stabilized normal form algorithm for generic systems of polynomial equations
- Algorithm 795
- Generalized normal forms and polynomial system solving
- H-bases for polynomial interpolation and system solving
- Introduction to Toric Varieties. (AM-131)
- Introduction to the solution of polynomial systems
- Matrices in elimination theory
- Multivariate polynomial system solving using intersections of eigenspaces.
- Newton polytopes and the Bezout theorem
- Numerical Polynomial Algebra
- Numerical solution of bivariate and polyanalytic polynomial systems
- Numerically solving polynomial systems with Bertini
- Polymake and Lattice Polytopes
- Polynomial Equations and Convex Polytopes
- Resultant over the residual of a complete intersection.
- Signature-based algorithms to compute Gröbner bases
- Solving polynomial equations. Foundations, algorithms, and applications
- Solving projective complete intersection faster
- Stable normal forms for polynomial system solving
- Subdivision methods for solving polynomial equations
- The Geometry of Syzygies
Cited in
(21)- The canonical decomposition of \(\mathcal{C}^n_d\) and numerical Gröbner and border bases
- Analysis of normal-form algorithms for solving systems of polynomial equations
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- Moment matrices, border bases and real radical computation
- Stable normal forms for polynomial system solving
- A normal form algorithm for tensor rank decomposition
- scientific article; zbMATH DE number 2098740 (Why is no real title available?)
- NORMAL BGG SOLUTIONS AND POLYNOMIALS
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Solving determinantal systems using homotopy techniques
- Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Numerical root finding via Cox rings
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- scientific article; zbMATH DE number 1639654 (Why is no real title available?)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Toric eigenvalue methods for solving sparse polynomial systems
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- A stabilized normal form algorithm for generic systems of polynomial equations
This page was built for publication: Solving polynomial systems via truncated normal forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689237)
