Contents

• Purpose
• Introduction
• Solutions of the convolution equation
  • The ``principal solution'' and ``invisible distributions''
  • Problems with the principal solution
• The `CLEAN' algorithm
  • The Högbom algorithm
  • The Clark algorithm
  • The Cotton-Schwab algorithm
  • Other algorithms related to `CLEAN'
  • Practical details and problems of `CLEAN'
  • The use of boxes: finite support
  • Number of iterations and the `CLEAN' loop gain
  • The problem of short spacings
  • The `CLEAN' beam
  • Use of a priori models in `CLEAN'
  • Non-uniqueness of `CLEAN' images
  • Instabilities
• The Maximum Entropy Method (MEM)
  • The default image (prior distribution)
  • Total flux density
  • Varying resolution
  • Bias
  • Point sources in extended emission
• Comparing `CLEAN' and MEM
• Algebraic deconvolution
  • Singular value decomposition
  • Non-negative least-squares
• Other methods, including hybrids
• References
• About this document ...

1996 November 4
10:52:31 EST