The feasibility of the interval Gaussian algorithm for arrowhead matrices (Q5935467)
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 1610322
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
arrowhead interval matrix
0 references
interval Gauss algorithm
0 references
0.9282234
0 references
0.9144981
0 references
0.8931713
0 references
0.8918716
0 references
0.8540051
0 references
