Almost strictly totally negative matrices: an algorithmic characterization

DOI10.1016/j.cam.2014.07.027zbMath1297.65027MaRDI QIDQ457727

María Luisa Serrano, Pedro Alonso, Juan Manuel Peña

Publication date: 29 September 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.07.027

zbMATH Keywords

almost strictly totally negative matrices; neville elimination; sign regular matrices

Mathematics Subject Classification ID

15B48: Positive matrices and their generalizations; cones of matrices

65F40: Numerical computation of determinants

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Editorial: Recent trends on computational and mathematical methods in science and engineering (CMMSE), QR decomposition of almost strictly sign regular matrices, Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting, On the characterization of totally nonpositive matrices

Uses Software

• TNTool

Cites Work

• Nonsingular almost strictly sign regular matrices
• Total positivity and Neville elimination
• A test for strict sign-regularity
• On nonsingular sign regular matrices
• Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices
• Conditioning and accurate computations with Pascal matrices
• Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices
• Accurate Computations with Totally Nonnegative Matrices
• Characterizations and Decompositions of Almost Strictly Positive Matrices
• Totally positive matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item