Stable normal forms for polynomial system solving
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1684370 (Why is no real title available?)
- scientific article; zbMATH DE number 5168255 (Why is no real title available?)
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 42050 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 1263318 (Why is no real title available?)
- scientific article; zbMATH DE number 578220 (Why is no real title available?)
- scientific article; zbMATH DE number 635677 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 2046152 (Why is no real title available?)
- scientific article; zbMATH DE number 2051431 (Why is no real title available?)
- scientific article; zbMATH DE number 1504686 (Why is no real title available?)
- scientific article; zbMATH DE number 2151244 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3103544 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A new efficient algorithm for computing Gröbner bases (F₄)
- An algebraist's view on border bases
- An elementary construction of the multigraded Hilbert scheme of points
- Characterizations of border bases
- Computing the isolated roots by matrix methods
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Generalized normal forms and polynomial system solving
- H-bases for polynomial interpolation and system solving
- Introduction to the solution of polynomial systems
- Matrices in elimination theory
- Numerical Polynomial Algebra
- On E. Cartan's Prolongation Theorem of Exterior Differential Systems
- Solving projective complete intersection faster
- Solving zero-dimensional systems through the rational univariate representation
Cited in
(19)- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Generalized normal forms and polynomial system solving
- NORMAL BGG SOLUTIONS AND POLYNOMIALS
- Complexity of Gröbner basis detection and border basis detection
- Computing coupled border bases
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- A stabilized normal form algorithm for generic systems of polynomial equations
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Border bases for lattice ideals
- Moment matrices, border bases and real radical computation
- Border basis relaxation for polynomial optimization
- Subideal border bases
- Overdetermined Weierstrass iteration and the nearest consistent system
- A Polyhedral Characterization of Border Bases
- Moments and sums of squares for polynomial optimization and related problems
- Stable border bases for ideals of points
- Numerical root finding via Cox rings
- Solving polynomial systems via truncated normal forms
- Flat families by strongly stable ideals and a generalization of Gröbner bases
This page was built for publication: Stable normal forms for polynomial system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378497)
