2010 **Abstract:** Magnetic tomography is an ill-posed and ill-conditioned inverse problem since, in general, the solution is non-unique and the measured magnetic field is affected by high noise. We use a joint sparsity constraint to regularize the magnetic inverse problem. This leads to a minimization problem whose solution can be approximated by an iterative thresholded Landweber algorithm. The algorithm is proved to be convergent and an error estimate is also given. Numerical tests on a bidimensional problem show that our alg…

Help me understand this report

Search citation statements

Paper Sections

Select...

1

Citation Types

0

1

0

Year Published

2011

2011

Publication Types

Select...

1

Relationship

0

1

Authors

Journals

(1 citation statement)

0

1

0

“…In contrast, one typically wants to obtain sparse sequences of dense vectors. A standard method for obtaining such results is the usage of a regularisation term that consists of the sum of the Euclidean norms of the coefficient vectors (see for instance [3,18,29,32]). Below, we also consider the setting where different norms than only the Euclidean one are used for the penalisation of the coefficient vectors.…”

confidence: 99%

“…In contrast, one typically wants to obtain sparse sequences of dense vectors. A standard method for obtaining such results is the usage of a regularisation term that consists of the sum of the Euclidean norms of the coefficient vectors (see for instance [3,18,29,32]). Below, we also consider the setting where different norms than only the Euclidean one are used for the penalisation of the coefficient vectors.…”

confidence: 99%