A test for strict sign-regularity (Q1319984): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(94)90485-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050313060 / rank | |||
Normal rank | |||
Revision as of 18:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A test for strict sign-regularity |
scientific article |
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
