IDEAS home Printed from https://ideas.repec.org/p/arx/papers/0809.3714.html
   My bibliography  Save this paper

Existence, uniqueness and a constructive solution algorithm for a class of finite Markov moment problems

Author

Listed:
  • Laurent Gosse

    (CNR BARI)

  • Olof Runborg

Abstract

We consider a class of finite Markov moment problems with arbitrary number of positive and negative branches. We show criteria for the existence and uniqueness of solutions, and we characterize in detail the non-unique solution families. Moreover, we present a constructive algorithm to solve the moment problems numerically and prove that the algorithm computes the right solution.

Suggested Citation

  • Laurent Gosse & Olof Runborg, 2008. "Existence, uniqueness and a constructive solution algorithm for a class of finite Markov moment problems," Papers 0809.3714, arXiv.org.
    • Handle: RePEc:arx:papers:0809.3714
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/0809.3714
    File Function: Latest version
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Octav Olteanu, 2021. "On the Moment Problem and Related Problems," Mathematics, MDPI, vol. 9(18), pages 1-26, September.
    2. Octav Olteanu, 2020. "From Hahn–Banach Type Theorems to the Markov Moment Problem, Sandwich Theorems and Further Applications," Mathematics, MDPI, vol. 8(8), pages 1-16, August.
    3. Octav Olteanu, 2013. "New Results on Markov Moment Problem," International Journal of Analysis, Hindawi, vol. 2013, pages 1-17, February.
    4. Octav Olteanu, 2022. "Convexity, Markov Operators, Approximation, and Related Optimization," Mathematics, MDPI, vol. 10(15), pages 1-17, August.
    5. Octav Olteanu, 2020. "Polynomial Approximation on Unbounded Subsets, Markov Moment Problem and Other Applications," Mathematics, MDPI, vol. 8(10), pages 1-12, September.

    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:arx:papers:0809.3714. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.