Solver - Inverse transforms

## Macros

#define | LANDWEBER (1U<< 0)
#define | STEEPEST_DESCENT (1U<< 1)
#define | CGNR (1U<< 2)
#define | CGNE (1U<< 3)
#define | NORMS_FOR_LANDWEBER (1U<< 4)
#define | PRECOMPUTE_WEIGHT (1U<< 5)
#define | PRECOMPUTE_DAMP (1U<< 6)

## Detailed Description

## Macro Definition Documentation

## LANDWEBER

#define LANDWEBER (1U<< 0)

If this flag is set, the Landweber (Richardson) iteration is used to compute an inverse transform.

Author
  Stefan Kunis

Definition at line 800 of file nfft3.h.

Referenced by CONCAT(), CONCAT(), and CONCAT().

## STEEPEST_DESCENT

#define STEEPEST_DESCENT (1U<< 1)

If this flag is set, the method of steepest descent (gradient) is used to compute an inverse transform.

Author
  Stefan Kunis

Definition at line 801 of file nfft3.h.

Referenced by CONCAT(), CONCAT(), CONCAT(), CONCAT(), and CONCAT().

## CGNR

#define CGNR (1U<< 2)

If this flag is set, the conjugate gradient method for the normal equation of first kind is used to compute an inverse transform. Each iterate minimises the residual in the current Krylov subspace.

Author
  Stefan Kunis

Definition at line 802 of file nfft3.h.

Referenced by CONCAT(), CONCAT(), CONCAT(), CONCAT(), CONCAT(), main(), reconstruct(), reconstruct(), reconstruct(), and reconstruct().

## CGNE

#define CGNE (1U<< 3)

If this flag is set, the conjugate gradient method for the normal equation of second kind is used to compute an inverse transform. Each iterate minimises the error in the current Krylov subspace.

Author
  Stefan Kunis

Definition at line 803 of file nfft3.h.

Referenced by CONCAT(), CONCAT(), CONCAT(), and main().

## NORMS_FOR_LANDWEBER

#define NORMS_FOR_LANDWEBER (1U<< 4)

If this flag is set, the Landweber iteration updates the member dot_r_iter.

Author
  Stefan Kunis

Definition at line 804 of file nfft3.h.

Referenced by solver_loop_one_step_landweber_complex(), and solver_loop_one_step_landweber_double().

## PRECOMPUTE_WEIGHT

#define PRECOMPUTE_WEIGHT (1U<< 5)

If this flag is set, the samples are weighted, eg to cope with varying sampling density.

Author
  Stefan Kunis

Definition at line 805 of file nfft3.h.

Referenced by CONCAT(), CONCAT(), CONCAT(), main(), reconstruct(), reconstruct(), reconstruct(), reconstruct(), solver_loop_one_step_cgne_complex(), solver_loop_one_step_cgne_double(), solver_loop_one_step_cgnr_complex(), solver_loop_one_step_cgnr_double(), solver_loop_one_step_landweber_complex(), solver_loop_one_step_landweber_double(), solver_loop_one_step_steepest_descent_complex(), and solver_loop_one_step_steepest_descent_double().

## PRECOMPUTE_DAMP

#define PRECOMPUTE_DAMP (1U<< 6)

If this flag is set, the Fourier coefficients are damped, eg to favour fast decaying coefficients.

Author
  Stefan Kunis

Definition at line 806 of file nfft3.h.

Referenced by CONCAT(), CONCAT(), CONCAT(), main(), reconstruct(), reconstruct(), reconstruct(), reconstruct(), solver_loop_one_step_cgne_complex(), solver_loop_one_step_cgne_double(), solver_loop_one_step_cgnr_complex(), solver_loop_one_step_cgnr_double(), solver_loop_one_step_landweber_complex(), solver_loop_one_step_landweber_double(), solver_loop_one_step_steepest_descent_complex(), and solver_loop_one_step_steepest_descent_double().