On the construction of general cubature formula by flat extensions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Linear Algebra and its Applications Year : 2016

On the construction of general cubature formula by flat extensions

Abstract

We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat extensions and show how to recover the cubature points and weights from the truncated Hankel operator. We next present an algorithm to test the flat extension property and to additionally compute the decomposition. To generate cubature formulae with a minimal number of points, we propose a new relaxation hierarchy of convex optimization problems minimizing the nuclear norm of the Hankel operators. For a suitably high order of convex relaxation, the minimizer of the optimization problem corresponds to a cubature formula. Furthermore cubature formulae with a minimal number of points are associated to faces of the convex sets. We illustrate our method on some examples, and for each we obtain a new minimal cubature formula.
Fichier principal
Vignette du fichier
paper-rev-hal.pdf (715.71 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01158099 , version 1 (29-05-2015)
hal-01158099 , version 2 (02-06-2015)
hal-01158099 , version 3 (02-06-2015)

Licence

Identifiers

Cite

Marta Abril Bucero, Chandrajit Bajaj, Bernard Mourrain. On the construction of general cubature formula by flat extensions. Linear Algebra and its Applications, 2016, 502, pp.104-125. ⟨10.1016/j.laa.2015.09.052⟩. ⟨hal-01158099v3⟩
645 View
260 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More