Numerical computation of H-bases (Q1999711): Difference between revisions

This paper presents an algorithm to compute H-bases using stable orthogonality methods. H-bases are similar to but distinct from Gröbner bases: a set of polynomials is an H-basis for an ideal $I$ if the ideal generated by the leading forms of those polynomials contain all the leading forms of polynomials in $I$. The change from leading monomials (in the case of Gröbner bases) to leading forms (in the case of H-bases) leads to additional computational complexity. The given algorithm uses the SVD to compute a minimal generating set for the syzygy of a given degree $k$ of the underlying ideal, and speeds up the computation dramatically, which is demonstrated in the paper via many numerical experiments. There is a very worthwhile discuss of numerical issues and ill-conditioned ideals, and an indication of directions for future work.