Computing border bases

DOI10.1016/J.JPAA.2005.07.006MaRDI QIDQ819794zbMATH OpenOpenAlexFDO

Authors Achim Kehrein, Martin Kreuzer

Publication date 29 March 2006

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpaa.2005.07.006

Mathematics Subject Classification ID

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

Recommendations

• Computing coupled border bases
• Computing subschemes of the border basis scheme
• Computing border bases using mutant strategies
• Computing border bases without using a term ordering
• On Parametric Border Bases
• The geometry of border bases
• Characterizations of border bases
• Computing all border bases for ideals of points
• Border basis detection is NP-complete

Cites work

• scientific article; zbMATH DE number 4076472 (Why is no real title available?)
• scientific article; zbMATH DE number 482758 (Why is no real title available?)
• scientific article; zbMATH DE number 1504686 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• An algebraist's view on border bases
• Applied algebra, algebraic algorithms and error-correcting codes. 10th international symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993. Proceedings
• Characterizations of border bases
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Numerical Polynomial Algebra

Cited in

(31)

• A Polyhedral Characterization of Border Bases
• Gröbner strata in the Hilbert scheme of points
• Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
• Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
• Computing border bases using mutant strategies
• An algebraist's view on border bases
• Stable normal forms for polynomial system solving
• Characterizations of border bases
• Computing all border bases for ideals of points
• Complexity of Gröbner basis detection and border basis detection
• Deformations of border bases
• الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی
• Computing H-bases via minimal bases for syzygy modules
• Border basis representation of a general quotient algebra
• Algebraic attacks galore!
• Artificial discontinuities of single-parametric Gröbner bases
• Computing border bases without using a term ordering
• Pivoting in extended rings for computing approximate Gröbner bases
• Border basis detection is NP-complete
• scientific article; zbMATH DE number 7142706 (Why is no real title available?)
• Computing coupled border bases
• Subideal border bases
• Toric border basis
• Term cancellations in computing floating-point Gröbner bases
• Border bases for lattice ideals
• Border basis for polynomial system solving and optimization
• Border bases and kernels of homomorphisms and of derivations
• From oil fields to Hilbert schemes
• Gröbner bases for syzygy modules of border bases
• Approximate computation of zero-dimensional polynomial ideals
• A signature based border basis algorithm

This page was built for publication: Computing border bases

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