Mean squared error minimization for inverse moment problems

Abstract

We consider the problem of approximating the unknown density u∈ L2(,λ) of a measure μ on ⊂n, absolutely continuous with respect to some given reference measure λ, from the only knowledge of finitely many moments of μ. Given d∈ and moments of order d, we provide a polynomial pd which minimizes the mean square error ∫ (u-p)2dλ over all polynomials p of degree at most d. If there is no additional requirement, pd is obtained as solution of a linear system. In addition, if pd 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 pd u in L2(,λ) as d∞. In general nonnegativity of pd is not guaranteed even though u is nonnegative. However, with this additional nonnegativity requirement one obtains analogous results but computing pd≥0 that minimizes ∫ (u-p)2dλ 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 u.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…