On the convergence of the generalized linear least squares algorithm (Q2568626)

From MaRDI portal
Revision as of 02:11, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On the convergence of the generalized linear least squares algorithm
scientific article

    Statements

    On the convergence of the generalized linear least squares algorithm (English)
    0 references
    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 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references