casacore: Fitting

Module for various forms of mathematical fitting. More...

Classes
class	casa::FitGaussian< T >
	Multidimensional fitter class for Gaussians. More...
class	FittingProxy
	This class gives Proxy to Fitting connection. More...
class	casa::GenericL2Fit< T >
	Generic base class for least-squares fit. More...
class	casa::LinearFit< T >
	Class for linear least-squares fit. More...
class	casa::LinearFitSVD< T >
	Linear least-squares fit using Singular Value Decomposition method. More...
class	casa::LSQaips
	Interface for aips++ Vectors in least squares fitting. More...
class	casa::LSQFit
	Basic class for the least squares fitting. More...
class	casa::LSQMatrix
	Support class for the LSQ package. More...
class	casa::LSQReal
	Typing support classes for LSQ classes. More...
class	casa::LSQComplex
	Type of complex numeric class indicator. More...
class	casa::LSQNull
	Non relevant class indicator. More...
class	casa::LSQType< T >
	Determine if pointer type. More...
class	casa::LSQTraits< T >
	Traits for numeric classes used. More...
class	casa::LSQTraits_F< Float >
	LSQTraits specialization for Float. More...
class	casa::LSQTraits_D< Double >
	LSQTraits specialization for Double. More...
class	casa::LSQTraits_CD< std::complex< Double > >
	LSQTraits specialization for DComplex. More...
class	casa::LSQTraits_CF< std::complex< Float > >
	LSQTraits specialization for Complex. More...
class	casa::NonLinearFit< T >
	Class for non-linear least-squares fit. More...
class	casa::NonLinearFitLM< T >
	Solve non-linear fit with Levenberg-Marquardt method. More...
Modules
	Fitting_module_internal_classes
	Internal Fitting_module classes and functions.

Detailed Description

Module for various forms of mathematical fitting.

See below for an overview of the classes in this module.

Prerequisite

Basic principles can be found in Note 224.

Review Status

Reviewed By:: Neil Killeen
Date Reviewed:: 2000/06/01
Demo programs:: dLSQFit,dConstraints

Synopsis

The Fitting module holds various classes and functions related to fitting models to data. Currently only least-squares fits are handled.

Least-Squares Fits

We are given N data points, which we will fit to a function with M adjustable parameters. N should normally be greater than M, and at least M non-dependent relations between the parameters should be given. In cases where there are less than M independent points, Singular-Value-Deconvolution methods are available. Each condition equation can be given an (estimated) standard deviation, which is comparable to the statistical weight, which is often used in place of the standard deviation.

The best fit is assumed to be the one which minimises the 'chi-squared'.

In the (rather common) case that individual errors are not known for the individual data points, one can assume that the individual errors are unity, calculate the best fit function, and then estimate the errors (assuming they are all identical) by inverting the normal equations. Of course, in this case we do not have an independent estimate of chi².

The methods used in the Fitting module are described in aips++ Note 224. The methods (both standard and SVD) are based on a Cholesky decomposition of the normal equations.

General background can also be found in Numerical Recipes by Press et al..

Linear Least-Squares Fits

The linear least squares solution assumes that the fit function is a linear combination of M linear condition equations. It is important to note that linear refers to the dependence on the parameters; the condition equations may be very non-linear in the dependent arguments.

The linear least squares problem is solved by explicitly forming and inverting the normal equations. If the normal equations are close to singular, the singular value decomposition (SVD) method may be used. Numerical Recipes suggests the SVD be always used, however this advice is not universally accepted.

Linear Least-Squares Fits with Known Linear Constraints

Sometimes there are not enough independent observations, i.e., the number of data points N is less than the number of adjustable parameters M. In this case the least-squares problem cannot be solved unless additional ``constraints'' on the adjustable parameters can be introduced. Under other circumstances, we may want to introduce constraints on the adjustable parameters to add additional information, e.g., the sum of angles of a triangle. In more complex cases, the forms of the constraints are unknown. Here we confine ourselves to least-squares fit problems in which the forms of constraints are known.

If the forms of constraint equations are known, the least-squares problem can be solved. (In the case where not enough independent observations are available, a minimum number of sufficient constraint equations have to be provided. The singular value decomposition method can be used to calculate the minimum number of orthogonal constraints needed).

Nonlinear Least-Squares Fits

We now consider the situation where the fitted function depends nonlinearly on the set of M adjustable parameters. But with nonlinear dependences the minimisation of chi² cannot proceed as in the linear case. However, we can linearise the problem, find an approximate solution, and then iteratively seek the minimising solution. The iteration stops when e.g. the adjusted parameters do not change anymore. In general it is very difficult to find a general solution that finds a global minimum, and the solution has to be matched with the problem. The Levenberg-Marquardt algorithm is a general non-linear fitting method which can produce correct results in many cases. It has been included, but always be aware of possible problems with non-linear solutions.

What Is Available?

The basic classes are LSQFit and LSQaips . They provide the basic framework for normal equation generation, solving the normal equations and iterating in the case of non-linear equations.

The LSQFit class uses a native C++ interface (pointers and iterators). They handle real data and complex data. The LSQaips class offers the functionality of LSQFit, but with an additional aips++ Array interface.

Functionality is

Fit a linear combination of functions to data points, and, optionally, use supplied constraint conditions on the adjustable parameters.
Fit a nonlinear function to data points. The adjustable parameters are parameters inside the function.
Repetitively perform a linear fit for every line of pixels parallel to any axis in a Lattice.
Solve (as opposed to fit to a set of data), a set of equations

In addition to the basic Least Squares routines in the LSQFit and LSQaips classes, this module contains also a set of direct data fitters:

Furthermore class LatticeFit can do fitting on lattices.

Note that the basic functions have LSQ in their title; the one-step fitting functions Fit.

The above fitting problems can usually be solved by directly calling the fit() member function provided by one of the Fit classes above, or by gradually building the normal equation matrix and solving the normal equations (solve()).

A Distributed Object interface to the classes is available (DOfitting) for use in the Glish dfit object, available through the fitting.g script.

Motivation

This module was motivated by baseline subtraction/continuum fitting in the first instance.

To Do

extend the Fit interface classes to cater for building the normal equations in parts.

Fitting_module [scimath package (libcasa_scimath)]

Classes

Modules