Identification of an algebraic domain in two dimensions from a finite number of its generalized polarization tensors

From MaRDI portal
Publication:2332932

DOI10.1007/S00208-018-1780-YzbMATH Open1479.35937arXiv1807.00396OpenAlexW2811253570WikidataQ114231126 ScholiaQ114231126MaRDI QIDQ2332932FDOQ2332932


Authors: Mihai Putinar, Andries Steenkamp, Faouzi Triki, Habib Ammari Edit this on Wikidata


Publication date: 5 November 2019

Published in: Mathematische Annalen (Search for Journal in Brave)

Abstract: This paper aims at studying how finitely many generalized polarization tensors of an algebraic domain can be used to determine its shape. Precisely, given a planar set with real algebraic boundary, it is shown that the minimal polynomial with real coefficients vanishing on the boundary can be identified as the generator of a one dimensional kernel of a matrix whose entries are obtained from a finite number of generalized polarization tensors. The size of the matrix depends polynomially on the degree of the boundary of the algebraic domain. The density with respect to Hausdorff distance of algebraic domains among all bounded domains invites to extend via approximation our reconstruction procedure beyond its natural context. Based on this, a new algorithm for shape recognition/classification is proposed with some strong hints about its efficiency.


Full work available at URL: https://arxiv.org/abs/1807.00396




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Identification of an algebraic domain in two dimensions from a finite number of its generalized polarization tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332932)