2008
DOI: 10.1090/s0025-5718-08-02107-8
|View full text |Cite
|
Sign up to set email alerts
|

A stable test for strict sign regularity

Abstract: Abstract. A stable test to check if a given matrix is strictly sign regular is provided. Among other nice properties, we prove that it has an optimal growth factor. The test is compared with other alternative tests appearing in the literature, and its advantages are shown.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…are the intermediate matrices of the elimination process as in (9). In [7] the authors prove that when the matrix is SSR the growth factor is 1. The following result shows that this property is also satisfied by ASSR matrices.…”
Section: Optimal Growth Factor and Astn Matricesmentioning
confidence: 98%
“…are the intermediate matrices of the elimination process as in (9). In [7] the authors prove that when the matrix is SSR the growth factor is 1. The following result shows that this property is also satisfied by ASSR matrices.…”
Section: Optimal Growth Factor and Astn Matricesmentioning
confidence: 98%
“…Recently, some newest tests for strictly sign regular matrices have been provided in [4]. In this section, we provide a test of O(n 3 ) elementary operations to check if a given nonsingular matrix is sign regular with signature (1, .…”
Section: A Test and Bidiagonal Factorizationmentioning
confidence: 99%