A multi-level algorithm for the solution of moment problems

Abstract

We study numerical methods for the solution of general linear moment problems, where the solution belongs to a family of nested subspaces of a Hilbert space. Multi-level algorithms, based on the conjugate gradient method and the Landweber--Richardson method are proposed that determine the "optimal" reconstruction level a posteriori from quantities that arise during the numerical calculations. As an important example we discuss the reconstruction of band-limited signals from irregularly spaced noisy samples, when the actual bandwidth of the signal is not available. Numerical examples show the usefulness of the proposed algorithms.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Invitation to fixed-parameter algorithms.Rolf Niedermeier - 2006 - New York: Oxford University Press.
Neural Network Learning as an Inverse Problem.Věra Kůrková - 2005 - Logic Journal of the IGPL 13 (5):551-559.
Improved FCM Algorithm Based on K-Means and Granular Computing.Zhuang Zhi Yan & Wei Jia Lu - 2015 - Journal of Intelligent Systems 24 (2):215-222.
Multi-Level Democracy.Christoph Möllers - 2011 - Ratio Juris 24 (3):247-266.
Multi‐Level Democracy.Christoph Möllers - 2011 - Ratio Juris 24 (3):247-266.

Analytics

Added to PP
2017-06-17

Downloads
1 (#1,898,347)

6 months
1 (#1,469,469)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references