Subideal border bases
From MaRDI portal
Publication:3168745
DOI10.1090/S0025-5718-2010-02432-9zbMath1219.13017arXiv0905.1090OpenAlexW2059068614MaRDI QIDQ3168745
Hennie Poulisse, Martin Kreuzer
Publication date: 19 April 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.1090
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical interpolation (65D05) Approximation by polynomials (41A10) Computational aspects in algebraic geometry (14Q99)
Related Items (6)
الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی ⋮ Computing border bases using mutant strategies ⋮ Simple varieties for limited precision points ⋮ Computing all border bases for ideals of points ⋮ From Oil Fields to Hilbert Schemes ⋮ A Polyhedral Characterization of Border Bases
Uses Software
Cites Work
- Approximate computation of zero-dimensional polynomial ideals
- Deformations of border bases
- Stable border bases for ideals of points
- Remarks on automatic algorithm stabilization
- Characterizations of border bases
- From Oil Fields to Hilbert Schemes
- Numerical Polynomial Algebra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subideal border bases