A matrixA issign-regular if, for each orderk, allk×k submatrices ofA have determinant with the same sign. In this paper, a pivoting strategy ofO(n) operations for the Gaussian elimination of linear systems whose coefficient matrices are sign-regular is proposed. Backward error analysis of this pivoting strategy is performed and small error bounds are obtained. Our results can also be applied to linear systems whose coefficient matrices have sign-regular inverses.
C. de Boor and A. Pinkus,Backward error analysis for totally positive linear systems, Numer. Math., 27 (1977), pp. 485–490.MATHCrossRefGoogle Scholar
L. D. Brown, I. M. Johnstone, and K. B. MacGibbon,Variation diminishing transformations: a direct approach to total positivity and its statistical applications, J. Amer. Statist. Assoc., 76 (1981), pp. 824–832.MATHMathSciNetCrossRefGoogle Scholar
J. M. Carnicer and J. M. Peña,Totally positive bases for shape preserving curve design and optimality of B-splines, Comput. Aided Geom. Design, 11 (1994), pp. 633–654.MATHMathSciNetCrossRefGoogle Scholar
J. M. Carnicer and J. M. Peña,On transforming a Tchebycheff system into a strictly totally positive system, J. Approx. Theory, 81 (1995), pp. 274–295.MATHMathSciNetCrossRefGoogle Scholar
J. M. Carnicer and J. M. Peña,Characterizations of the optimal Descartes' rules of signs. To appear in Math. Nachr. (1997).Google Scholar
G. E. Forsythe and C. B. Moler.Computer Solutions of Linear Algebraic Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1967.Google Scholar
M. Gasca and J. M. Peña,A test for strict sign-regularity, Linear Algebra Appl., 197–198 (1994), pp. 133–142.CrossRefGoogle Scholar