Almost strictly totally negative matrices: an algorithmic characterization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5802119 (Why is no real title available?)
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 1506179 (Why is no real title available?)
- A test for strict sign-regularity
- Accurate Computations with Totally Nonnegative Matrices
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Characterizations and Decompositions of Almost Strictly Positive Matrices
- Conditioning and accurate computations with Pascal matrices
- Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices
- Nonsingular almost strictly sign regular matrices
- On nonsingular sign regular matrices
- Total positivity and Neville elimination
- Totally nonnegative matrices
- 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
- scientific article; zbMATH DE number 1930336 (Why is no real title available?)
- On the characterization of totally nonpositive matrices
- scientific article; zbMATH DE number 1506179 (Why is no real title available?)
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)