On the convergence of the generalized linear least squares algorithm (Q2568626)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the convergence of the generalized linear least squares algorithm |
scientific article; zbMATH DE number 2215897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence of the generalized linear least squares algorithm |
scientific article; zbMATH DE number 2215897 |
Statements
On the convergence of the generalized linear least squares algorithm (English)
0 references
18 October 2005
0 references
The authors present theoretical considerations concerning the generalized linear least squares (GLLS) algorithm, first introduced by \textit{D. Feng} and \textit{D. Ho} [Parametric imaging algorithms for multicompartmental models dynamic studies with positron emission tomography, in K. Uemura, N. A. Lassen, T. Jones, and I. Kanno (eds.), Quantification of Brain Function:Tracer Kinetics and Image Analysis in Brain PET, Elsevier Science Publishers, Amsterdam,The Netherlands 127--137 (1993)]. They consider the inverse problem of parameter estimate of a linear continuous dynamic system by introducing in GLLS both Gauss-Newton and alternating Gauss-Newton algorithms for solving it. Numerical experiments in the field of clinical positron emission tomography are also presented.
0 references
iterative methods
0 references
parameter estimation
0 references
generalized linear least squares
0 references
algorithm
0 references
inverse problem
0 references
dynamic system
0 references
Gauss-Newton algorithms
0 references
numerical experiments
0 references
clinical positron emission tomography
0 references
0.7247627973556519
0 references
0.7200935482978821
0 references
0.7012320756912231
0 references