FAST MAXIMUM ENTROPY ALGORITHM FOR ILL-POSED PROBLEMS

S.V. Meshkov and D.V. Berkov
Additional contact information
S.V. Meshkov: Laboratoire de Physique Mathématique et Théorique, Université de Montpellier II Place Eugène Bataillon, Case 50, 34095 Montpellier, France
D.V. Berkov: Institute of Chemical Physics 142432, Chernogolovka, Moscow district, Russia

International Journal of Modern Physics C (IJMPC), 1994, vol. 05, issue 06, 987-995

Abstract: The fast algorithm of the Maximum Entropy (MaxEnt) numerical solution of the linear inverse problem is described. The minimization of a general functional intrinsic to the MaxEnt approach is reduced to an iteration procedure with each step being a constrained least-squares problem (minimization of a quadratic functional with linear inequality constraints). The algorithm is structurally simple and can be assembled from blocks available in standard program libraries. The algorithm is tested on “toy” tasks with exponential kernel, as well as on practical problems of the recovery of the spectral density of strongly correlated quantum systems from the imaginary time Green’s functions obtained by Monte Carlo.

Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183194001094
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:05:y:1994:i:06:n:s0129183194001094

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183194001094

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().