AbstractA family of quadrature rules for integration over tetrahedral volumes is developed. The underlying structure of the rules is based on the cubic close-packed (CCP) lattice arrangement using 1, 4, 10, 20, 35, and 56 quadrature points. The rules are characterized by rapid convergence, positive weights, and symmetry. Each rule is an optimal approximation in the sense that lower-order terms have zero contribution to the truncation error and the leading-order error term is minimized. Quadrature formulas up to order 9 are presented with relevant numerical examples
In this paper we describe a methodology for the identification of sym-metric quadrature rules inside...
We explore many different packings of regular tetrahedra, with various clusters & lattices & symmetr...
A numerical integration rule for multivariate cubic polynomials over n-dimensional simplices was des...
AbstractIn this paper we describe a methodology for the identification of symmetric quadrature rules...
This paper presents a Gaussian Quadrature method for the evaluation of the triple integral View the ...
This paper presents a Gaussian quadrature method for the evaluation of the triple integral I = â«â«â...
We present a program for computing symmetric quadrature rules on triangles and tetrahedra. A set of ...
AbstractWe present a class of quadrature rules on triangles in R2 which, somewhat similar to Gaussia...
AbstractWe present a numerical algorithm for the construction of efficient, high-order quadratures i...
In this paper, we first present a Gauss Legendre Quadrature rule for the evaluation of I = â« T f(x,...
This paper is concerned with two important elements in the high-order accurate spatial discretizatio...
This paper is concerned with two important elements in the high-order accurate spatial discretizatio...
AbstractWe present a numerical algorithm for the construction of efficient, high-order quadratures i...
A numerical integration rule for multivariate cubic polynomials over n-dimensional simplices was des...
AbstractNewton–Cotes quadrature rules are based on polynomial interpolation in a set of equidistant ...
In this paper we describe a methodology for the identification of sym-metric quadrature rules inside...
We explore many different packings of regular tetrahedra, with various clusters & lattices & symmetr...
A numerical integration rule for multivariate cubic polynomials over n-dimensional simplices was des...
AbstractIn this paper we describe a methodology for the identification of symmetric quadrature rules...
This paper presents a Gaussian Quadrature method for the evaluation of the triple integral View the ...
This paper presents a Gaussian quadrature method for the evaluation of the triple integral I = â«â«â...
We present a program for computing symmetric quadrature rules on triangles and tetrahedra. A set of ...
AbstractWe present a class of quadrature rules on triangles in R2 which, somewhat similar to Gaussia...
AbstractWe present a numerical algorithm for the construction of efficient, high-order quadratures i...
In this paper, we first present a Gauss Legendre Quadrature rule for the evaluation of I = â« T f(x,...
This paper is concerned with two important elements in the high-order accurate spatial discretizatio...
This paper is concerned with two important elements in the high-order accurate spatial discretizatio...
AbstractWe present a numerical algorithm for the construction of efficient, high-order quadratures i...
A numerical integration rule for multivariate cubic polynomials over n-dimensional simplices was des...
AbstractNewton–Cotes quadrature rules are based on polynomial interpolation in a set of equidistant ...
In this paper we describe a methodology for the identification of sym-metric quadrature rules inside...
We explore many different packings of regular tetrahedra, with various clusters & lattices & symmetr...
A numerical integration rule for multivariate cubic polynomials over n-dimensional simplices was des...