The feasibility of the interval Gaussian algorithm for arrowhead matrices (Q5935467)

From MaRDI portal
Revision as of 00:39, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 1610322
Language Label Description Also known as
English
The feasibility of the interval Gaussian algorithm for arrowhead matrices
scientific article; zbMATH DE number 1610322

    Statements

    The feasibility of the interval Gaussian algorithm for arrowhead matrices (English)
    0 references
    0 references
    26 June 2001
    0 references
    An arrowhead interval matrix is defined as a quadratic matrix which only has nonzero interval entries in the main diagonal, in the last line, and in the last column. It is shown that the application of the interval Gauss algorithm without pivoting is feasible for such a matrix iff the main diagonal entries do not contain zero.
    0 references
    0 references
    arrowhead interval matrix
    0 references
    interval Gauss algorithm
    0 references

    Identifiers