Almost strictly totally negative matrices: an algorithmic characterization
DOI10.1016/J.CAM.2014.07.027zbMATH Open1297.65027OpenAlexW2072884142MaRDI QIDQ457727FDOQ457727
Authors: Pedro Alonso, María Luisa Serrano, J. M. 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
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Positive matrices and their generalizations; cones of matrices (15B48) Numerical computation of determinants (65F40)
Cites Work
- Totally positive matrices
- Total positivity and Neville elimination
- On nonsingular sign regular matrices
- Accurate Computations with Totally Nonnegative Matrices
- Nonsingular almost strictly sign regular matrices
- Title not available (Why is that?)
- Conditioning and accurate computations with Pascal matrices
- Totally nonnegative matrices
- A test for strict sign-regularity
- Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizations and Decompositions of Almost Strictly Positive Matrices
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
Cited In (10)
- Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting
- Nonsingular almost strictly sign regular matrices
- ASSR matrices and some particular cases
- An optimal test for almost strict total positivity
- QR decomposition of almost strictly sign regular matrices
- Editorial: Recent trends on computational and mathematical methods in science and engineering (CMMSE)
- Algorithmic characterization of pentadiagonal ASSR matrices
- Title not available (Why is that?)
- On the characterization of totally nonpositive matrices
- Title not available (Why is that?)
Uses Software
This page was built for publication: Almost strictly totally negative matrices: an algorithmic characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457727)