Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

A stable test for strict sign regularity


Authors: V. Cortés and J. M. Peña
Journal: Math. Comp. 77 (2008), 2155-2171
MSC (2000): Primary 65F05, 65F40, 15A48
DOI: https://doi.org/10.1090/S0025-5718-08-02107-8
Published electronically: March 19, 2008
MathSciNet review: 2429879
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 65F05, 65F40, 15A48

Retrieve articles in all journals with MSC (2000): 65F05, 65F40, 15A48


Additional Information

V. Cortés
Affiliation: Departamento de Matemática Aplicada, Universidad de Zaragoza, 50009, Zaragoza, Spain
Email: vcortes@unizar.es

J. M. Peña
Affiliation: Departamento de Matemática Aplicada, Universidad de Zaragoza, 50009, Zaragoza, Spain
Email: jmpena@posta.unizar.es

DOI: https://doi.org/10.1090/S0025-5718-08-02107-8
Keywords: Strictly sign regular matrices, Neville elimination, pivoting strategies.
Received by editor(s): November 17, 2007
Published electronically: March 19, 2008
Additional Notes: This research has been partially supported by the Spanish Research Grant MTM2006-03388 and by Gobierno de Aragón and Fondo Social Europeo.
Article copyright: © Copyright 2008 American Mathematical Society