A fast and precise genetic algorithm for a non-linear fitting problem

Fitting procedures are currently used in a large set of computational problems and several algorithms have been developed. However, a complication appears when the fitting function is non-linear and non-lineariable. In this case, a Marquardt–Levenberg procedure is generally used, but it often requir...

Full description

Saved in:
Bibliographic Details
Published inComputer physics communications Vol. 124; no. 2; pp. 204 - 211
Main Author Brunetti, Antonio
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.02.2000
Elsevier Science
Subjects
Online AccessGet full text
ISSN0010-4655
1879-2944
DOI10.1016/S0010-4655(99)00454-3

Cover

More Information
Summary:Fitting procedures are currently used in a large set of computational problems and several algorithms have been developed. However, a complication appears when the fitting function is non-linear and non-lineariable. In this case, a Marquardt–Levenberg procedure is generally used, but it often requires interactions with the user. Here a new method is proposed which is based on a genetic algorithm technique. This kind of algorithm allows fitting in a completely automatic mode, without any manipulation over the fitting function. The algorithm developed is generally faster and more precise than traditional genetic algorithms reported in the literature. Its performances are comparable to those in the Marquardt–Levenberg algorithm technique. It has been developed as fitting method for measurements of X-ray tube response. Fitting this response is very important to avoid any patient injuries. The results obtained are reported here and compared to other genetic algorithm implementations, as well as a Marquardt–Levenberg procedure.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0010-4655
1879-2944
DOI:10.1016/S0010-4655(99)00454-3