A test for strict sign-regularity (Q1319984)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A test for strict sign-regularity |
scientific article; zbMATH DE number 553957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A test for strict sign-regularity |
scientific article; zbMATH DE number 553957 |
Statements
A test for strict sign-regularity (English)
0 references
19 April 1994
0 references
A characterization of strict sign-regular matrices is obtained in an algorithmic form. This allows the construction of a test to check if a matrix \(A\) is strictly sign-regular. The test is based on the Neville elimination of several submatrices of \(A\) and requires less computational work than previous characterizations.
0 references
algorithm
0 references
strict sign-regular matrices
0 references
Neville elimination
0 references
0.917667269706726
0 references
0.8118420243263245
0 references
0.7884319424629211
0 references
0.7827646136283875
0 references
0.782764196395874
0 references
