Adaptive Wavelet Galerkin Methods for Linear Inverse Problems
نویسنده
چکیده
We introduce and analyze numerical methods for the treatment of inverse problems, based on an adaptive wavelet Galerkin discretization. These methods combine the theoretical advantages of the wavelet-vaguelette decomposition (WVD) in terms of optimally adapting to the unknown smoothness of the solution, together with the numerical simplicity of Galerkin methods. In a first step, we simply combine a thresholding algorithm on the data with a Galerkin inversion on a fixed linear space. In a second step, a more elaborate method performs the inversion by an adaptive procedure in which a smaller space adapted to the solution is iteratively constructed; this leads to a significant reduction of the computational cost.
منابع مشابه
Poisson Inverse Problems
In this paper, we fo us on nonparametri estimators in inverse problems for Poisson pro esses involving the use of wavelet de ompositions. Adopting an adaptive wavelet Galerkin dis retization we nd that our method ombines the well know theoreti al advantages of wavelet-vaguelette de ompositions for inverse problems in terms of optimally adapting to the unknown smoothness of the solution, togethe...
متن کاملPiecewise tensor product wavelet bases by extensions and approximation rates
In this chapter, we present some of the major results that have been achieved in the context of the DFG-SPP project “Adaptive Wavelet Frame Methods for Operator Equations: Sparse Grids, Vector-Valued Spaces and Applications to Nonlinear Inverse Problems”. This project has been concerned with (nonlinear) elliptic and parabolic operator equations on nontrivial domains as well as with related inve...
متن کاملAn efficient space-time adaptive wavelet Galerkin method for time-periodic parabolic partial differential equations
We introduce a multitree-based adaptive wavelet Galerkin algorithm for space-time discretized linear parabolic partial differential equations, focusing on time-periodic problems. It is shown that the method converges with the best possible rate in linear complexity and can be applied for a wide range of wavelet bases. We discuss the implementational challenges arising from the Petrov-Galerkin n...
متن کاملAdaptive Wavelet Methods for Differential Equations
In this thesis we study stable Wavelet Galerkin schemes for solving initial value problems. The methods use the Daubechies family of orthogonal wavelets as bases for the solution. Their order of convergence is p− 1, where p is the number of vanishing moments of the wavelet function. Their stability regions are similar to those for BDF multistep methods of the same order. Due to the nature of th...
متن کامل