Computationally feasible high-resolution minimum-distance procedures which extend the maximum-entropy method

DOI10.1088/0266-5611/5/5/006zbMath0701.62016OpenAlexW4235299758MaRDI QIDQ3479361

Victor Trutzer, Lee Kenneth Jones

Publication date: 1989

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/5/5/006

zbMATH Keywords

directed distancesdirected orthogonality propertygeometric reconstruction algorithmshigh-resolution capabilitylinear functional valuesLp spectrum estimationMaximum-entropy techniques

Mathematics Subject Classification ID

Problems related to evolution (92D15) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10) Probabilistic methods, stochastic differential equations (65C99)

Related Items (2)

Re-examination of Bregman functions and new properties of their divergences ⋮ The convergence of entropy-based approximations for moment problems

This page was built for publication: Computationally feasible high-resolution minimum-distance procedures which extend the maximum-entropy method