Abstract

One method for constructing cubature formulae of a given degree of precision consists of using the common zeros of a finite set F of polynomials as nodes. The formula exists if and only if F is an H-basis and some well-defined orthogonality conditions hold. Groebner bases and especially Buchberger’s algorithm for their computation allow an effective calculation of H-bases and easy proofs and generalizations of known methods based on H-bases. Groebner bases, a powerful tool in Computer Algebra for analyzing ideals and solving systems of algebraic equations, allow in addition the calculation of the common zeros of the polynomials in F also in cases, where the number of unknowns is different from the number of equations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.