Fast multilevel augmentation methods with compression technique for solving ill-posed integral equations
The subject of this paper is the regularization of linear ill-posed problems \( \mathcal{A} u = f \) by multilevel augmentation methods combined with compression techniques. Here, \( \mathcal{A}: \mathbf{X} \to \mathbf{X} \) is a linear, positive semidefinite integral operator in the Hilbert space \( \mathbf{X} = L^2(E) \), where \( E \subset \mathbf{R}^d \) is a bounded domain, and \( f \in \mathbf{X} \). The basic regularization scheme is Lavrentiev's method \( (\alpha \mathcal{I} + A)u_\alpha^\delta = f^\delta \), where \( f^\delta \in \mathbf{X} \) is an approximation of the right-hand side \( f \) with \( \| f^\delta - f \| \leq \delta \). In addition, \( \alpha > 0 \) is a regularization parameter, and \( \mathcal{I} \) denotes the identity operator. For the multiscale decomposition, piecewise polynomial spaces \( \mathbf{X}_n \) with \( \mathbf{X}_{n} \subset \mathbf{X}_{n+1} \) (\( n \in \mathbf{N}_0\)) are considered, and \( \bigcup_{n \in \mathbf{N}_0} \mathbf{X}_{n} \) is supposed to be dense in \( \mathbf{X} \). The basis for the multilevel augmentation algorithm is the approximative equation \( (\alpha \mathcal{I} + \widetilde{\mathcal{A}}_n)\widetilde{u}_{\alpha,n}^\delta = f_n^\delta \), where \( \widetilde{\mathcal{A}}_n \) is some compression of \( \mathcal{A}_n = \mathcal{P}_n \mathcal{A} \mathcal{P}_n \), with \( \mathcal{P}_n : \mathbf{X} \to \mathbf{X}_n \) denoting the orthogonal projection onto \( \mathbf{X}_n \), and \( f_n^\delta = \mathcal{P}_n f^\delta \). The authors present an estimate of the error \( \| \widehat{u} - \widetilde{u}_{\alpha,n}^\delta \| \), where \( \widehat{u} \in \mathbf{X} \) denotes the minimum solution of \( \mathcal{A} u = f \), and \( \alpha > 0 \) is arbitrary here. For this estimate, smoothness assumptions on the kernel of the integral operator \( \mathcal{A} \) are made, and a source condition for the minimum solution \( \widehat{u} \in \mathbf{X} \) of \( \mathcal{A} u = f \) is needed. In addition, approximation properties of the spaces \( \mathbf{X}_n \) are required. The sparsity of \( \widetilde{\mathcal{A}}_n \) is also considered in this paper. Then the truncated multilevel augmentation algorithm is considered. It is based on a decomposition of the form \( [\widetilde{\mathcal{B}}_{\ell,m}(\alpha) + \widetilde{\mathcal{C}}_{\ell,m}(\alpha)] \widetilde{u}_{\alpha,\ell+m}^\delta = \alpha^{-1} f_{\ell+m}^\delta \). Here, \( n = \ell+m \), \( \widetilde{\mathcal{B}}_{\ell,m}(\alpha) = \mathcal{I} + \alpha^{-1} \widetilde{\mathcal{A}}_{\ell,m}^L \) and \( \widetilde{\mathcal{C}}_{\ell,m}(\alpha) = \alpha^{-1} \widetilde{\mathcal{A}}_{\ell,m}^H \), where \( \widetilde{\mathcal{A}}_{\ell,m}^L = \mathcal{P}_\ell \widetilde{\mathcal{A}}_{\ell+m} \mathcal{P}_{\ell+m} \) and \( \widetilde{\mathcal{A}}_{\ell,m}^H = (\mathcal{P}_{\ell+m}- \mathcal{P}_{\ell}) \widetilde{\mathcal{A}}_{\ell+m} \mathcal{P}_{\ell+m} \). An a posteriori parameter choice of the parameter \( \alpha \) is proposed, and order optimal error estimates are presented under the assumptions considered above, and for \( \ell \) sufficiently large. Finally some numerical results are presented.
- A multilevel augmentation method for solving ill-posed operator equations
- Fast multi-level iteration methods with compression technique for solving ill-posed integral equations
- Multilevel Jacobi and Gauss-Seidel type iteration methods for solving ill-posed integral equations
- Multilevel augmentation algorithms based on fast collocation methods for solving ill-posed integral equations
- Multilevel augmentation methods for nonlinear ill-posed problems
- A construction of interpolating wavelets on invariant sets
- A fast multiscale Galerkin method for the first kind ill-posed integral equations via Tikhonov regularization
- A multilevel augmentation method for solving ill-posed operator equations
- A multilevel method for solving operator equations
- A wavelet multilevel method for ill-posed problems stabilized by Tikhonov regularization
- An adaptive discretization for Tikhonov-Phillips regularization with a posteriori parameter selection
- Cascadic multilevel methods for ill-posed problems
- Fast Collocation Methods for Second Kind Integral Equations
- Fast collocation methods for solving ill-posed integral equations of the first kind
- Fast wavelet transforms and numerical algorithms I
- scientific article; zbMATH DE number 3868512 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 2202146 (Why is no real title available?)
- Multigrid preconditioning and Toeplitz matrices
- Multilevel algorithms for ill-posed problems
- On the regularizing properties of a full multigrid method for ill-posed problems
- Self-regularization by projection for noisy pseudodifferential equations of negative order
- Subspace preconditioned LSQR for discrete ill-posed problems
- The Galerkin scheme for Lavrentiev's m-times iterated method to solve linear accretive Volterra integral equations of the first kind
- Two-level preconditioners for regularized inverse problems. I: Theory
- Using the matrix refinement equation for the construction of wavelets on invariant sets
- Wavelet approximation methods for pseudodifferential equations. II: Matrix compression and fast solution
- Wavelet Galerkin methods for second-kind integral equations
- Wavelet-Galerkin methods for ill-posed problems
- A parameter choice strategy for a multilevel augmentation method in iterated Lavrentiev regularization
- Heuristic parameter choice rule for solving linear ill-posed integral equations in finite dimensional space
- Fast multi-level iteration methods with compression technique for solving ill-posed integral equations
- A fast multilevel iteration method for solving linear ill-posed integral equations
- Adaptive multilevel iteration methods for solving ill-posed integral equations via a coupled system
- scientific article; zbMATH DE number 2202146 (Why is no real title available?)
- A fast algorithm for parameter identification problems based on the multilevel augmentation method
- Fast multi-level iteration schemes with compression technique for eigen-problems of compact integral operators
- Multilevel augmentation algorithms based on fast collocation methods for solving ill-posed integral equations
- A modified discrepancy principle for adaptive multiscale nonstationary iterated Tikhonov regularization with multilevel iteration algorithm
This page was built for publication: Fast multilevel augmentation methods with compression technique for solving ill-posed integral equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548792)