Refine
Has Fulltext
- yes (2)
Document Type
- Preprint (2)
Language
- English (2)
Is part of the Bibliography
- no (2) (remove)
The aim of this paper is to describe an efficient strategy for descritizing ill-posed linear operator equations of the first kind: we consider Tikhonov-Phillips-regularization χ^δ α = (a * a + α I)^-1 A * y ^δ with a finite dimensional approximation A n instead of A. We propose a sparse matrix structure which still leads to optimal convergences rates but requires substantially less scalar products for computing A n compared with standard methods.
Contents: 1 Introduction 1.1 Tikhanov-Phillips Regularization of Ill-Posed Problems 1.2 A Compact Course to Wavelets 2 A Multilevel Iteration for Tikhonov-Phillips Regularization 2.1 Multilevel Splitting 2.2 The Multilevel Iteration 2.3 Multilevel Approach to Cone Beam Reconstuction 3 The use of approximating operators 3.1 Computing approximating families {Ah}