The feasibility of the interval Gaussian algorithm for arrowhead matrices (Q5935467): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011439403749 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1502568651 / rank | |||
Normal rank | |||
Latest revision as of 11:00, 30 July 2024
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
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
