A new criterion for normal form algorithms
From MaRDI portal
Recommendations
Cited in
(63)- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- On border basis and Gröbner basis schemes
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A generalized flat extension theorem for moment matrices
- Polynomial-exponential decomposition from moments
- Flat extension and ideal projection
- A stabilized normal form algorithm for generic systems of polynomial equations
- Complexity of Gröbner basis detection and border basis detection
- Characterizations of border bases
- Computing border bases without using a term ordering
- The close relation between border and Pommaret marked bases
- Numerical root finding via Cox rings
- Computing coupled border bases
- A signature based border basis algorithm
- Computing syzygies in finite dimension using fast linear algebra
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- Tensor factorisation for narrowband single channel source decomposition
- Stable normal forms for polynomial system solving
- Local Bézout theorem for Henselian rings
- Computing zero-dimensional schemes
- Bezoutian and quotient ring structure
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Rational univariate reduction via toric resultants
- On deflation and multiplicity structure
- Certified Hermite matrices from approximate roots
- The approach of moments for polynomial equations
- On the construction of general cubature formula by flat extensions
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Border bases for lattice ideals
- Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
- From oil fields to Hilbert schemes
- Term cancellations in computing floating-point Gröbner bases
- Simple varieties for limited precision points
- scientific article; zbMATH DE number 549085 (Why is no real title available?)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Solving polynomial systems via truncated normal forms
- Overdetermined Weierstrass iteration and the nearest consistent system
- scientific article; zbMATH DE number 2098740 (Why is no real title available?)
- Generalized normal forms and polynomial system solving
- Computing all border bases for ideals of points
- Macaulay-like marked bases
- A Polyhedral Characterization of Border Bases
- الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی
- Symmetric tensor decomposition
- Towards a Gröbner-free approach to coding
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Artificial discontinuities of single-parametric Gröbner bases
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Stabilized recovery and model reduction for multivariate exponential polynomials
- Isolated singularities, inverse systems and the punctual Hilbert scheme
- Yet another eigenvalue algorithm for solving polynomial systems
- Cohen-Macaulay, Gorenstein and complete intersection conditions by marked bases
- Pivoting in extended rings for computing approximate Gröbner bases
- Polynomial equations: theory and practice
- An algorithm for computing quasi-homogeneous formal normal forms under equivalence
- Twisted cohomology and likelihood ideals
- Border bases in the rational Weyl algebra
- Computing border bases
- Deformations of border bases
- Border basis relaxation for polynomial optimization
- Local Bézout theorem
This page was built for publication: A new criterion for normal form algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502650)
