Algorithms for matrix estimation (Q1287259)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1290390
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithms for matrix estimation
    scientific article; zbMATH DE number 1290390

      Statements

      Algorithms for matrix estimation (English)
      0 references
      0 references
      0 references
      19 October 1999
      0 references
      Matrix estimation means the restoration of an exact value of a matrix using the measurements of a certain (usually linear) function of the matrix. The measurements are assumed to be either accurate or corrupted by random noise. The authors investigate algorithms for matrix estimation in the presence of random disturbances for various observation schemes. Theorems on convergence of recursive algorithms are proved and the results of numerical simulation are presented. The incorporation of artificial noise into observations is considered whereby the restrictions imposed on the measurement points can be weakened. An application of matrix least-squares estimation to the problem of searching for a root of a function of several variables is proposed. It is astonishing that almost no special attention has been paid to the problems of matrix estimation, although these issues were actually discussed in the literature.
      0 references
      matrix estimation
      0 references
      least-squares estimation
      0 references
      recursive algorithms
      0 references
      artificial noise
      0 references
      difference estimations
      0 references
      searching for a root of a function
      0 references
      averaging method
      0 references

      Identifiers