MARKOV MOMENT PROBLEM AND RELATED APPROXIMATION

被引:0
|
作者
Olteanu, Octav [1 ]
机构
[1] Univ Politehn Bucuresti, Dept Math Informat, Bucharest 060042, Romania
来源
MATHEMATICAL REPORTS | 2015年 / 17卷 / 01期
关键词
Markov moment problems; approximation; extension of linear operators; concrete spaces; COMPACT;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We apply approximation results of certain functions of several variables by means of sums of tensor products of positive polynomials on the real line, in each separate variable, which are sums of squares. This leads to characterizations of the existence of the solutions of the multidimensional Markov moment problem in terms of quadratic forms or mappings, similarly to the one-dimensional case. From this point of view, one solves the difficulty created by the existence of positive polynomials that are not sums of squares in several dimensions. On the other hand, applications of general results to concrete spaces are considered. The continuity of the dominating operator seems to be essential in proving the properties of the solution.
引用
收藏
页码:107 / 117
页数:11
相关论文
共 50 条
  • [21] Complexity and approximation of an area packing problem
    Hurkens, C. A. J.
    Lodi, A.
    Martello, S.
    Monaci, M.
    Woeginger, G. J.
    OPTIMIZATION LETTERS, 2012, 6 (01) : 1 - 9
  • [22] Numerical Approximation of a Unilateral Obstacle Problem
    E. B. Mermri
    W. Han
    Journal of Optimization Theory and Applications, 2012, 153 : 177 - 194
  • [23] Approximation and Related Semantic Structures
    Inkova, Olga
    LANGAGES, 2023, (229) : 135 - +
  • [24] Numerical Approximation of a Unilateral Obstacle Problem
    Mermri, E. B.
    Han, W.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 153 (01) : 177 - 194
  • [25] Complexity and approximation of an area packing problem
    C. A. J. Hurkens
    A. Lodi
    S. Martello
    M. Monaci
    G. J. Woeginger
    Optimization Letters, 2012, 6 : 1 - 9
  • [26] Complexity and approximation for scheduling problem for a torpedo
    Giroudeau, R.
    Koenig, J. C.
    Simonin, G.
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 300 - 304
  • [27] Complexity and approximation of the Constrained Forest problem
    Bazgan, Cristina
    Couetoux, Basile
    Tuza, Zsolt
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (32) : 4081 - 4091
  • [28] An approximation algorithm for the register allocation problem
    Jansen, K
    Reiter, J
    INTEGRATION-THE VLSI JOURNAL, 1998, 25 (02) : 89 - 102
  • [29] Complexity and approximation for scheduling problem for a torpedo
    Simonin, G.
    Giroudeau, R.
    Koenig, J. C.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (02) : 352 - 356
  • [30] On Kernelization and Approximation for the Vector Connectivity Problem
    Kratsch, Stefan
    Sorge, Manuel
    ALGORITHMICA, 2017, 79 (01) : 96 - 138