A bivariate preprocessing paradigm for the Buchberger-Möller algorithm

DOI10.1016/J.CAM.2010.04.035zbMATH Open1203.13031arXiv1001.1186OpenAlexW2052074478MaRDI QIDQ989141FDOQ989141

Authors: Xiaoying Wang, Shugong Zhang, Tian Dong 

Publication date: 27 August 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: For the last almost three decades, since the famous Buchberger-M"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of bivariate polynomial interpolation on cartesian point sets that gives us related degree reducing interpolation monomial and Newton bases directly. Since the bases are involved in the computation process as well as contained in the final output of BM algorithm, our paradigm obviously simplifies the computation and accelerates the BM process. The experiments show that the paradigm is best suited for the computation over finite prime fields that have many applications.

Full work available at URL: https://arxiv.org/abs/1001.1186

Recommendations

• Preconditioning the bidomain model with almost linear complexity
• scientific article; zbMATH DE number 1086519
• scientific article; zbMATH DE number 1159872
• scientific article; zbMATH DE number 4000639
• scientific article; zbMATH DE number 877100
• scientific article; zbMATH DE number 3948927
• Novel bivariate moment-closure approximations

zbMATH Keywords

bivariate Lagrange interpolationCartesian setdegree reducing interpolation spaceBuchberger-Möller algorithm

Mathematics Subject Classification ID

Numerical interpolation (65D05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• Using Algebraic Geometry
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multivariate Birkhoff interpolation
• From algebraic sets to monomial linear bases by means of combinatorial algorithms
• The lex game and some applications
• Title not available (Why is that?)
• Interpolation from spaces spanned by monomials
• Title not available (Why is that?)
• A computational algebra approach to the reverse engineering of gene regulatory networks
• Lagrange interpolation on subgrids of tensor product grids
• Polynomial interpolation in several variables: lattices, differences, and ideals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing ideals of points
• Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art
• Computing Gröbner bases of ideals of few points in high dimensions

Cited In (2)

• Finite sets of affine points with unique associated monomial order quotient bases
• A two-dimensional improvement for Farr-Gao algorithm

Uses Software

• Maple

This page was built for publication: A bivariate preprocessing paradigm for the Buchberger-Möller algorithm

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