A feasibility result for interval Gaussian elimination relying on graph structure (Q2738481)

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 1639655
Language Label Description Also known as
default for all languages
No label defined
    English
    A feasibility result for interval Gaussian elimination relying on graph structure
    scientific article; zbMATH DE number 1639655

      Statements

      0 references
      12 May 2002
      0 references
      interval Gaussian elimination without pivoting
      0 references
      feasibility of elimination
      0 references
      graph structure
      0 references
      interval matrix
      0 references
      tridiagonal and arrowhead matrices
      0 references
      A feasibility result for interval Gaussian elimination relying on graph structure (English)
      0 references
      The author presents a new feasibility result regarding interval Gaussian elimination relying on the graph of the interval matrix. According to the main result, interval Gaussian elimination is feasible if the graph is a tree and if conventional elimination can be performed on all matrices with real elements. Examples and application, including tridiagonal and arrowhead matrices, are also discussed. For the entire collection see [Zbl 0963.00018].
      0 references

      Identifiers