Two-Dimensional Minimal Cubature Formulas and Matrix Equations
Author:
- Hans Joachim SchmidHSHans Joachim Schmid
- 1 July 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 16 (3) , 898-921
Abstract
For strictly positive, linear, and centrally symmetric functionals in two dimensions the existence of cubature formulas attaining the known lower bounds is equivalent to the solvability of certain matrix equations under some constraints. Any solution generates a real ideal the common roots of which are the nodes of the cubature formula. These results are applied to construct an infinite number of minimal positive cubature formulas of an arbitrary degree of exactness for one special, but classical, integral.Keywords
This publication has 15 references indexed in Scilit:
- A new lower bound for the number of nodes in cubature formulae of degree 4 n + 1 for some circularly symmetric integrals1993
- Minimal cubature formulae of degree 2k−1 for two classical functionalsComputing, 1989
- Orthogonality and Recursion Formulas for Polynomials in n VariablesSIAM Journal on Mathematical Analysis, 1982
- The Recursion Formulas for Orthogonal Polynomials innVariablesSIAM Journal on Mathematical Analysis, 1982
- Construction of Algebraic Cubature Rules Using Polynomial Ideal TheorySIAM Journal on Numerical Analysis, 1978
- Kubaturformeln mit minimaler KnotenzahlNumerische Mathematik, 1976
- Local reality on algebraic varietiesJournal of Algebra, 1974
- Un theoreme des zeros en geometries algebrique et analytique reelles1974
- A construction of nonnegative approximate quadraturesMathematics of Computation, 1967
- Zur mechanischen KubaturMonatshefte für Mathematik, 1948