IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v05y1994i06ns0129183194001094.html
   My bibliography  Save this article

Fast Maximum Entropy Algorithm For Ill-Posed Problems

Author

Listed:
  • 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)

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.

Suggested Citation

  • S.V. Meshkov & D.V. Berkov, 1994. "Fast Maximum Entropy Algorithm For Ill-Posed Problems," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 5(06), pages 987-995.
    • Handle: RePEc:wsi:ijmpcx:v:05:y:1994:i:06:n:s0129183194001094
    DOI: 10.1142/S0129183194001094
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183194001094
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183194001094?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:05:y:1994:i:06:n:s0129183194001094. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.