Incomplete Gröbner basis as a preconditioner for polynomial systems
From MaRDI portal
(Redirected from Publication:1008653)
preconditionerdegree reductionhomotopy continuationdeficient nonlinear algebraic systemPHCpackS-polynomialssubtraction polynomialBézout numberincomplete Gröbner basis (IGB)truncated Gröbner basis
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10)
Recommendations
Cites work
- scientific article; zbMATH DE number 3937298 (Why is no real title available?)
- scientific article; zbMATH DE number 50337 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- A new start system for solving deficient polynomial systems using continuation
- Algorithm 795
- Bézout number calculations for multi-homogeneous polynomial systems
- Coefficient-parameter polynomial continuation
- Finding all isolated solutions to polynomial systems using HOMPACK
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Mathematical reduction of a heart dipole model
- Minimizing multi-homogeneous Bézout numbers by a local search method
- Nonlinear reduction for solving deficient polynomial systems by continuation methods
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed
This page was built for publication: Incomplete Gröbner basis as a preconditioner for polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008653)