No label defined (Q3314859)

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 3844929
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3844929

      Statements

      1981
      0 references
      comparison
      0 references
      normal equations
      0 references
      Givens rotation
      0 references
      sparse least squares problems
      0 references
      Gaussian elimination with complete pivoting
      0 references
      numerical experiments
      0 references
      numerical stability
      0 references
      [For the entire collection see Zbl 0504.00026.] The use of normal equations and Givens rotation for solving sparse least squares problems are discussed. The first-algorithm is based on the use of Gaussian elimination with complete pivoting. The authors review both the algorithms and provide a fairly good sample of computational results. Based on these numerical experiments they conclude that the first algorithm should be used when the observation matrix is sparse and numerical stability is unimportant. The second algorithm, which is based on Givens rotation, is preferable if numerical stability is major issue.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references