Subideal border bases

DOI10.1090/S0025-5718-2010-02432-9MaRDI QIDQ3168745zbMATH OpenOpenAlexFDO

Authors Martin Kreuzer, Hennie Poulisse

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

zbMATH Keywords

border basesapproximate commutative algebraapproximate vanishing idealsBuchberger-Möller algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects in algebraic geometry (14Q99) Approximation by polynomials (41A10)

Abstract: In modeling physical systems it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases, provide some basic properties and generalize a suitable variant of the Buchberger-Moeller algorithm as well as the AVI-algorithm to the subideal setting. The subideal version of the AVI-algorithm is then applied to an actual industrial problem.

Recommendations

• Approximate computation of zero-dimensional polynomial ideals
• A Polyhedral Characterization of Border Bases
• Computing border bases without using a term ordering
• From oil fields to Hilbert schemes
• Border basis representation of a general quotient algebra
• Stable border bases for ideals of points
• Computing border bases
• Characterizations of border bases
• Stable normal forms for polynomial system solving
• An algebraist's view on border bases

Cites work

• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• An algebraist's view on border bases
• Approximate computation of zero-dimensional polynomial ideals
• Characterizations of border bases
• Deformations of border bases
• From oil fields to Hilbert schemes
• Numerical Polynomial Algebra
• Remarks on automatic algorithm stabilization
• Stable border bases for ideals of points

Cited in

(14)

• Stable border bases for ideals of numerical Cartesian sets
• Toric border basis
• Computing border bases without using a term ordering
• الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی
• From oil fields to Hilbert schemes
• Computing border bases using mutant strategies
• Border basis representation of a general quotient algebra
• Computing all border bases for ideals of points
• Border bases and kernels of homomorphisms and of derivations
• A Polyhedral Characterization of Border Bases
• Simple varieties for limited precision points
• Stable border bases for ideals of points
• Approximate computation of zero-dimensional polynomial ideals
• Border basis for polynomial system solving and optimization

Describes a project that uses

Uses Software

• ApCoCoA
• CoCoA

This page was built for publication: Subideal border bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168745)