An adaptive discretization for Tikhonov-Phillips regularization with a posteriori parameter selection
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 struc...
Main Authors: | , , , |
---|---|
Format: | Others |
Language: | English |
Published: |
Universität Potsdam
1998
|
Subjects: | |
Online Access: | http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-14739 http://opus.kobv.de/ubp/volltexte/2007/1473/ |
Summary: | 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. |
---|