Computing border bases

DOI10.1016/J.JPAA.2005.07.006zbMATH Open1097.13036OpenAlexW2116004197MaRDI QIDQ819794FDOQ819794

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Title not available (Why is that?)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Title not available (Why is that?)
• Numerical Polynomial Algebra
• Characterizations of border bases
• An algebraist's view on border bases
• Title not available (Why is that?)
• 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

Cited In (31)

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

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)