scientific article; zbMATH DE number 1504686

zbMath0976.12005MaRDI QIDQ4502650

Publication date: 12 September 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithm normal forms Laurent polynomials polynomial ring quotient algebra zero-dimensional algebra

Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Computing border bases ⋮ Polynomial-exponential decomposition from moments ⋮ On the construction of general cubature formula by flat extensions ⋮ The close relation between border and Pommaret marked bases ⋮ Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization ⋮ On deflation and multiplicity structure ⋮ Flat extension and ideal projection ⋮ Stable normal forms for polynomial system solving ⋮ A stabilized normal form algorithm for generic systems of polynomial equations ⋮ Deformations of border bases ⋮ Border bases for lattice ideals ⋮ الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی ⋮ Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems ⋮ Local Bézout theorem for Henselian rings ⋮ Numerical root finding via Cox rings ⋮ Symmetric tensor decomposition ⋮ Simple varieties for limited precision points ⋮ Computing coupled border bases ⋮ A signature based border basis algorithm ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ Border basis relaxation for polynomial optimization ⋮ Towards a Gröbner-free approach to coding ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ Certified Hermite matrices from approximate roots ⋮ Artificial discontinuities of single-parametric Gröbner bases ⋮ Computing border bases without using a term ordering ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ Computing all border bases for ideals of points ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Computing zero-dimensional schemes ⋮ Bezoutian and quotient ring structure ⋮ Pivoting in extended rings for computing approximate Gröbner bases ⋮ Complexity of Gröbner basis detection and border basis detection ⋮ From Oil Fields to Hilbert Schemes ⋮ Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) ⋮ Macaulay-like marked bases ⋮ A Polyhedral Characterization of Border Bases ⋮ Term Cancellations in Computing Floating-Point Gröbner Bases ⋮ Characterizations of border bases ⋮ Flat families by strongly stable ideals and a generalization of Gröbner bases ⋮ Local Bézout theorem ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ The Approach of Moments for Polynomial Equations ⋮ Rational univariate reduction via toric resultants ⋮ 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 ⋮ Tensor factorisation for narrowband single channel source decomposition

Uses Software

FGb