Computing almost minimal formulas on the square

Authors:
Mattia Festa;Alvise Sommariva
Affiliations:
-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2012

Citing 10
Cited 0

Lagrange interpolation on Chebyshev points of two variables

Journal of Approximation Theory
Monomial cubature rules since “Stroud”: a compilation—part 2

Journal of Computational and Applied Mathematics - Numerical evaluation of integrals
On the (non)-existence of some cubature formulas: gaps between a theory and its applications

Journal of Complexity
A Cardinal Function Algorithm for Computing Multivariate Quadrature Points

SIAM Journal on Numerical Analysis
Asymmetric cubature formulas for polynomial integration in the triangle and square

Journal of Computational and Applied Mathematics
A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions

Computers & Mathematics with Applications
Improved cubature formulae of high degrees of exactness for the square

Journal of Computational and Applied Mathematics
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra

SIAM Journal on Numerical Analysis
A Nonlinear Optimization Procedure for Generalized Gaussian Quadratures

SIAM Journal on Scientific Computing
Computing Fekete and Lebesgue points: Simplex, square, disk

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	7.29

Visualization

Abstract

The main purpose of this paper is to introduce a numerical method for the computation of cubature rules on the square [-1,1]^2 that are almost minimal, i.e. with few points w.r.t. the degree of precision d. In particular for all 24@?d@?55 the sets {@x"d} and the weights {w"k} are new. New rules are also achieved for degrees 15, d=17, 19 and d=23 respectively with 43, 54, 67 and 96 points.