2001
DOI: 10.1063/1.1360711
|View full text |Cite|
|
Sign up to set email alerts
|

The Hausdorff entropic moment problem

Abstract: Our aim in this paper is twofold. First, to find the necessary and sufficient conditions to be satisfied by a given sequence of real numbers {ωn}n=0∞ to represent the “entropic moments” ∫[0,a][ρ(x)]ndx of an unknown non-negative, decreasing and differentiable (a.e.) density function ρ(x) with a finite interval support. These moments are called entropic moments because they are closely connected with various information entropies (Renyi, Tsallis, …). Second, we outline an efficient method for the reconstruction… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2003
2003
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 27 publications
(27 citation statements)
references
References 19 publications
0
27
0
Order By: Relevance
“…The authors of [9] realize that other density reconstruction procedures, alternative to ordinary moments, would be desirable. We propose fractional moments density reconstruction procedure.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The authors of [9] realize that other density reconstruction procedures, alternative to ordinary moments, would be desirable. We propose fractional moments density reconstruction procedure.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…This example is borrowed from [9]. Here the authors attempt to recover a nonnegative decreasing differentiable function f (x) from the frequency moments ω n , with…”
Section: Numerical Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…for the Crámer-Rao [36][37][38], Fisher-Shannon [39,40] and LMC complexities [41], respectively. Each of them grasps the combined balance of two different facets of the probability density.…”
Section: Information-theoretic Measures: Basicsmentioning
confidence: 99%