Mean squared error minimization for inverse moment problems

D Henrion, JB Lasserre, M Mevissen - Applied Mathematics & …, 2014 - Springer
Applied Mathematics & Optimization, 2014Springer
We consider the problem of approximating the unknown density u ∈ L^ 2 (Ω, λ) u∈ L 2 (Ω,
λ) of a measure μ μ on Ω ⊂ R^ n Ω⊂ R n, absolutely continuous with respect to some given
reference measure λ λ, only from the knowledge of finitely many moments of μ μ. Given d ∈
N d∈ N and moments of order dd, we provide a polynomial p_d pd which minimizes the
mean square error ∫ (up)^ 2d λ∫(up) 2 d λ over all polynomials pp of degree at most d d. If
there is no additional requirement, p_d pd is obtained as solution of a linear system. In …
Abstract
We consider the problem of approximating the unknown density of a measure on , absolutely continuous with respect to some given reference measure , only from the knowledge of finitely many moments of . Given and moments of order , we provide a polynomial which minimizes the mean square error over all polynomials of degree at most . If there is no additional requirement, is obtained as solution of a linear system. In addition, if is expressed in the basis of polynomials that are orthonormal with respect to , its vector of coefficients is just the vector of given moments and no computation is needed. Moreover in as . In general nonnegativity of is not guaranteed even though is nonnegative. However, with this additional nonnegativity requirement one obtains analogous results but computing that minimizes now requires solving an appropriate semidefinite program. We have tested the approach on some applications arising from the reconstruction of geometrical objects and the approximation of solutions of nonlinear differential equations. In all cases our results are significantly better than those obtained with the maximum entropy technique for estimating .
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果